diff --git a/.github/dependabot.yml b/.github/dependabot.yml
new file mode 100644
index 0000000..5043f0c
--- /dev/null
+++ b/.github/dependabot.yml
@@ -0,0 +1,12 @@
+version: 2
+updates:
+  - package-ecosystem: npm
+    directory: /
+    schedule:
+      interval: monthly
+    open-pull-requests-limit: 5
+  - package-ecosystem: github-actions
+    directory: /
+    schedule:
+      interval: monthly
+    open-pull-requests-limit: 5
diff --git a/.github/workflows/ci.yml b/.github/workflows/ci.yml
new file mode 100644
index 0000000..6cf7866
--- /dev/null
+++ b/.github/workflows/ci.yml
@@ -0,0 +1,32 @@
+name: CI
+
+on:
+  push:
+    branches:
+      - main
+      - 'agent/**'
+  pull_request:
+    branches:
+      - main
+
+permissions:
+  contents: read
+
+concurrency:
+  group: ci-${{ github.ref }}
+  cancel-in-progress: true
+
+jobs:
+  verify:
+    runs-on: ubuntu-latest
+    timeout-minutes: 15
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-node@v4
+        with:
+          node-version: 24
+          cache: npm
+      - run: npm ci
+      - run: npm run check
+      - run: npx playwright install --with-deps chromium
+      - run: npm run test:e2e
diff --git a/.github/workflows/deploy-pages.yml b/.github/workflows/deploy-pages.yml
new file mode 100644
index 0000000..08e1fcc
--- /dev/null
+++ b/.github/workflows/deploy-pages.yml
@@ -0,0 +1,43 @@
+name: Deploy Pages
+
+on:
+  push:
+    branches:
+      - main
+  workflow_dispatch:
+
+permissions:
+  contents: read
+  pages: write
+  id-token: write
+
+concurrency:
+  group: pages
+  cancel-in-progress: false
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-node@v4
+        with:
+          node-version: 24
+          cache: npm
+      - run: npm ci
+      - run: npm run build
+      - uses: actions/configure-pages@v5
+      - uses: actions/upload-pages-artifact@v3
+        with:
+          path: dist
+
+  deploy:
+    environment:
+      name: github-pages
+      url: ${{ steps.deployment.outputs.page_url }}
+    runs-on: ubuntu-latest
+    needs: build
+    steps:
+      - name: Deploy
+        id: deployment
+        uses: actions/deploy-pages@v4
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..603e60a
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,8 @@
+node_modules/
+dist/
+coverage/
+playwright-report/
+test-results/
+.vite/
+*.log
+*.tsbuildinfo
diff --git a/.nvmrc b/.nvmrc
new file mode 100644
index 0000000..a45fd52
--- /dev/null
+++ b/.nvmrc
@@ -0,0 +1 @@
+24
diff --git a/.prettierignore b/.prettierignore
new file mode 100644
index 0000000..d862c75
--- /dev/null
+++ b/.prettierignore
@@ -0,0 +1,12 @@
+dist
+coverage
+playwright-report
+test-results
+Boolean Minimizer.apk
+android
+ios
+windows11
+icons.json
+legacy
+報告書.md
+測資.md
diff --git a/.prettierrc.json b/.prettierrc.json
new file mode 100644
index 0000000..ab57af6
--- /dev/null
+++ b/.prettierrc.json
@@ -0,0 +1,5 @@
+{
+  "singleQuote": true,
+  "trailingComma": "none",
+  "printWidth": 100
+}
diff --git a/Boolean Minimizer.apk b/Boolean Minimizer.apk
deleted file mode 100644
index e6da3fc..0000000
Binary files a/Boolean Minimizer.apk and /dev/null differ
diff --git a/LICENSE b/LICENSE
new file mode 100644
index 0000000..3132b7a
--- /dev/null
+++ b/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Bigsticktw
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/README.md b/README.md
index 12970b9..7c47d0d 100644
--- a/README.md
+++ b/README.md
@@ -1,301 +1,116 @@
-# 🧮 多輸出布林函數最小化工具
-
-## 📖 文件
-
-- [報告書](./報告書.md)
-- [測資](./測資.md)
-
-## 🌐 線上版本
-**🚀 立即使用：[https://bigsticktw.github.io/boolean-function-minimizer/](https://bigsticktw.github.io/boolean-function-minimizer/)**
-
-[![PWA Ready](https://img.shields.io/badge/PWA-Ready-brightgreen.svg)](https://bigsticktw.github.io/boolean-function-minimizer/)
-[![GitHub Pages](https://img.shields.io/badge/GitHub%20Pages-Live-blue.svg)](https://bigsticktw.github.io/boolean-function-minimizer/)
-[![License](https://img.shields.io/badge/License-MIT-yellow.svg)](LICENSE)
-
-## 📋 項目簡介
-
-這是一個基於 **Patrick Method** 演算法的多輸出布林函數最小化工具，專為邏輯電路設計和布林代數最佳化而開發。該工具支援多種輸入格式，能夠自動找到最佳的邏輯表達式，並通過硬體共享最小化總體成本。
-
-**🚀 現已支援 PWA (Progressive Web App) 功能，可安裝到桌面和手機！**
-
-## ✨ 功能特色
-
-### 🎯 核心功能
-- **多輸出最佳化**：同時處理多個布林函數，找到全域最佳解
-- **Patrick Method 演算法**：實現完整的三階段最佳化流程
-- **硬體共享最佳化**：自動識別可共享的 Prime Implicants，降低硬體成本
-- **智能算法選擇**：根據問題規模自動選擇回溯搜索或窮舉搜索
-
-### 📱 PWA 功能
-- **🔗 線上使用**：[https://bigsticktw.github.io/boolean-function-minimizer/](https://bigsticktw.github.io/boolean-function-minimizer/)
-- **📱 Android 安裝**：支援安裝到 Android 手機主畫面
-- **⚡ 離線使用**：安裝後可在無網路環境下使用
-- **🚀 快速啟動**：從主畫面直接啟動，載入速度快
-- **🔄 自動更新**：應用更新時自動同步最新版本
-- **🌐 全平台網頁版**：所有平台都可使用完整網頁版功能
-
-### 🆕 最新功能
-- **📤 分享結果**：一鍵分享計算結果到其他應用
-- **📋 複製結果**：快速複製結果到剪貼板
-- **📁 檔案拖放**：支援拖放 `.txt` 和 `.json` 檔案載入數據
-- **🔗 URL 參數**：支援 `?mode=pi` 和 `?mode=minterm` 直接切換模式
-- **⚡ 快捷方式**：安裝後可直接啟動特定輸入模式
-
-### 📊 輸入模式
-1. **Prime Implicants 模式**：直接輸入已知的 Prime Implicants
-2. **Minterms 模式**：輸入 Minterms 和 Don't Care 項，自動生成 Prime Implicants
-
-### 🔍 算法特色
-- **三階段成本計算**：
-  - Stage 1：基本 PI 成本計算
-  - Stage 2：各函數獨立冗餘移除
-  - Stage 3：Patrick 共享成本計算
-- **智能剪枝**：多層剪枝策略提高搜索效率
-- **成本最佳化**：支援單個 literal 和多個 literals 的不同成本計算
-
-## 🚀 快速開始
-
-### 🌐 線上使用（推薦）
-**直接訪問：[https://bigsticktw.github.io/boolean-function-minimizer/](https://bigsticktw.github.io/boolean-function-minimizer/)**
-
-### 📱 PWA 安裝
-
-> **📱 目前僅支援 Android 設備安裝**  
-> iOS、Windows、macOS 等平台的 PWA 安裝功能正在開發中，敬請期待！
-
-1. **Android 手機瀏覽器**：
-   - 使用 Chrome、Edge 或其他支援 PWA 的瀏覽器
-   - 訪問 [線上版本](https://bigsticktw.github.io/boolean-function-minimizer/)
-   - 點擊「加入主畫面」或「安裝應用程式」
-   - 應用圖標將出現在主畫面上，可離線使用
-
-2. **桌面瀏覽器**（僅網頁版）：
-   - 訪問 [線上版本](https://bigsticktw.github.io/boolean-function-minimizer/)
-   - 可正常使用所有功能，但暫不支援安裝到桌面
-   - 建議加入書籤以便快速訪問
-
-3. **快捷啟動**：
-   - PI 模式：[https://bigsticktw.github.io/boolean-function-minimizer/?mode=pi](https://bigsticktw.github.io/boolean-function-minimizer/?mode=pi)
-   - Minterm 模式：[https://bigsticktw.github.io/boolean-function-minimizer/?mode=minterm](https://bigsticktw.github.io/boolean-function-minimizer/?mode=minterm)
-
-### 💻 本地部署
-1. 克隆或下載項目文件
-2. 使用 HTTP 服務器運行（避免 CORS 問題）：
-   ```bash
-   # Python 3
-   python -m http.server 8000
-   
-   # Node.js
-   npx serve .
-   
-   # PHP
-   php -S localhost:8000
-   ```
-3. 訪問 `http://localhost:8000`
-
-### 系統需求
-- **網頁版**：現代網頁瀏覽器（Chrome 88+、Firefox 85+、Safari 14+、Edge 88+）
-- **Android PWA**：Android 設備 + Chrome/Edge 瀏覽器
-- **技術要求**：支援 JavaScript ES6+、Service Worker
-- **其他平台**：僅支援網頁版，功能完整但無法安裝
-
-## 📖 使用指南
-
-### 1. 設定變數
-在「變數設定」欄位中輸入邏輯變數，用逗號分隔：
-```
-x,y,z
-```
-或
-```
-a,b,c,d
-```
-
-### 2. 選擇輸入模式
-
-#### Prime Implicants 模式
-適用於已知 Prime Implicants 的情況：
-
-**範例輸入**：
-```
-函數 F1:
-- PI1: 01-
-- PI2: -11
-
-函數 F2:
-- PI1: 0-1
-- PI2: 1-0
-```
-
-**輸出函數定義**（可選）：
-```
-F1: 2,3,6,7
-F2: 1,4,5
-```
-
-#### Minterms 模式
-適用於從 Minterms 開始設計的情況：
-
-**範例輸入**：
-```
-函數 F1:
-- Minterms: 2,3,6,7
-- Don't Care: 1
-
-函數 F2:
-- Minterms: 1,4,5
-- Don't Care: 0
-```
-
-### 3. 執行最佳化
-點擊「🚀 執行多輸出最佳化」按鈕，系統將：
-1. 解析輸入資料
-2. 生成或處理 Prime Implicants
-3. 執行 Patrick Method 演算法
-4. 計算最佳共享方案
-5. 顯示詳細結果
-
-### 4. 結果操作
-- **📤 分享結果**：將結果分享到其他應用
-- **📋 複製結果**：複製完整結果到剪貼板
-- **📁 檔案操作**：拖放檔案載入數據
-
-### 5. 結果解讀
-
-#### 最佳化結果範例
-```
-🔹 解決方案 1:
-F1 = b'c' + bd' + ac' + cd
-使用的PI: --11, -00-, -1-0, 1-0-
-共享成本: 12 個閘級
-
-🔹 解決方案 2:
-F1 = c'd' + b'd + ac' + bc
-使用的PI: --00, -0-1, -11-, 1-0-
-共享成本: 12 個閘級
-```
-
-#### 成本分析
-```
-💰 成本分析
-成本計算方式：1個literal成本=1，多個literals成本=literal數量+1
-例如：y 有 1 個符號，成本為 1；x'z' 有 2 個符號，成本為 2 + 1 = 3
-
-個別最佳化總成本: 12
-共享最佳化總成本: 12
-```
-
-## 🛠️ 技術架構
-
-### 前端技術
-- **HTML5**：語義化標記和現代 Web 標準
-- **CSS3**：響應式設計和現代視覺效果
-- **JavaScript ES6+**：模組化程式設計和現代語法
-- **PWA**：Service Worker、Web App Manifest
-
-### 核心算法
-- **Quine-McCluskey**：Prime Implicants 生成
-- **Patrick Method**：最小覆蓋求解
-- **回溯搜索**：最佳化解空間探索
-- **動態規劃**：成本計算最佳化
-
-### PWA 特性
-- **Service Worker**：離線緩存和更新管理
-- **Web App Manifest**：應用配置和圖標
-- **Cache API**：智能緩存策略
-- **Background Sync**：背景同步（未來功能）
-
-## 📊 性能指標
-
-### 算法效能(單函數輸出情況)
-- **小規模問題**（≤4變數）：< 100ms
-- **中規模問題**（5-6變數）：< 1s
-- **大規模問題**（7+變數）：< 10s（視複雜度而定）
-
-### PWA 性能
-- **首次載入**：< 2s
-- **重複訪問**：< 500ms（緩存）
-- **離線啟動**：< 300ms
-- **安裝大小**：< 1MB
-
-## 🔧 開發指南
-
-### 項目結構
-```
-boolean-function-minimizer/
-├── index.html              # 主要網頁
-├── patrick-method-core.js   # 核心算法
-├── manifest.json           # PWA 配置
-├── sw.js                   # Service Worker
-├── README.md              # 項目說明
-├── android/               # Android 圖標
-├── ios/                   # iOS 圖標
-├── windows11/             # Windows 圖標
-└── icons.json             # 圖標配置
-```
-
-### 本地開發
-1. **克隆項目**：
-   ```bash
-   git clone https://github.com/bigsticktw/boolean-function-minimizer.git
-   cd boolean-function-minimizer
-   ```
-
-2. **啟動開發服務器**：
-   ```bash
-   python -m http.server 8000
-   ```
-
-3. **訪問開發版本**：
-   ```
-   http://localhost:8000
-   ```
-
-### 部署更新
-1. **推送到 GitHub**：
-   ```bash
-   git add .
-   git commit -m "Update features"
-   git push origin main
-   ```
-
-2. **GitHub Pages 自動部署**：
-   - 推送後自動更新線上版本
-   - 通常在 1-2 分鐘內生效
-
-## 🤝 貢獻指南
-
-歡迎提交 Issue 和 Pull Request！
-
-### 報告問題
-- 使用 [GitHub Issues](https://github.com/bigsticktw/boolean-function-minimizer/issues)
-- 提供詳細的問題描述和重現步驟
-- 包含瀏覽器版本和操作系統資訊
-
-### 功能建議
-- 在 Issues 中標記為 `enhancement`
-- 描述功能的用途和預期行為
-- 提供使用場景和範例
-
-### 代碼貢獻
-1. Fork 項目
-2. 創建功能分支
-3. 提交變更
-4. 發起 Pull Request
-
-## 🙏 致謝
-
-- **Patrick Method 演算法**：基於經典的邏輯最小化理論
-- **Quine-McCluskey 演算法**：Prime Implicants 生成的標準方法
-- **PWA 技術**：現代 Web 應用開發標準
-- **GitHub Pages**：免費的靜態網站託管服務
-
-## 📞 聯絡資訊
-
-- **線上工具**：[https://bigsticktw.github.io/boolean-function-minimizer/](https://bigsticktw.github.io/boolean-function-minimizer/)
-- **GitHub 項目**：[https://github.com/bigsticktw/boolean-function-minimizer](https://github.com/bigsticktw/boolean-function-minimizer)
-- **問題回報**：[GitHub Issues](https://github.com/bigsticktw/boolean-function-minimizer/issues)
-
----
-
-**🚀 立即體驗：[https://bigsticktw.github.io/boolean-function-minimizer/](https://bigsticktw.github.io/boolean-function-minimizer/)** 
\ No newline at end of file
+# Boolean Logic Minimizer
+
+[繁體中文](#繁體中文) · [English](#english)
+
+[![CI](https://github.com/Bigsticktw/boolean-function-minimizer/actions/workflows/ci.yml/badge.svg)](https://github.com/Bigsticktw/boolean-function-minimizer/actions/workflows/ci.yml)
+[![GitHub Pages](https://img.shields.io/badge/demo-GitHub%20Pages-087f78)](https://bigsticktw.github.io/boolean-function-minimizer/)
+[![License: MIT](https://img.shields.io/badge/license-MIT-f05a3c.svg)](LICENSE)
+
+![Boolean Logic Minimizer interface](public/social-preview.png)
+
+## 繁體中文
+
+這是一個 correctness-first 的布林函數最小化工具：先用 Quine–McCluskey 產生
+Prime Implicants，再用 Petrick cover 搜尋最小 SOP。所有計算都在瀏覽器本機完成。
+
+### 為什麼重構
+
+舊版可操作，但演算法、DOM 與結果格式化集中在兩個約 2,400 行的檔案，沒有自動測試，
+也會在三變數輸入 `m8` 時錯誤產生第四變數 `X3`。v2 把輸入契約、純演算法核心、
+Web Worker、UI 與部署拆開，並把該錯誤固定為 regression test。
+
+### 已驗證能力
+
+- Minterms 與進階 Prime Implicants 兩種輸入模式。
+- 1–6 個變數、最多 4 個輸出的 bounded Exact prime-cover mode。
+- minterm 範圍、重複值、don’t-care 衝突、PI 寬度及 off-set 覆蓋驗證。
+- 多輸出共享 product term 成本模型。
+- 256 種三變數 truth table 的完整等價性與最佳成本 oracle。
+- Unit、regression、property 與 Playwright browser E2E。
+- Web Worker 運算、靜態 GitHub Pages 與版本化 PWA cache。
+
+### 成本模型
+
+- 單一 literal 的 product term 成本為 `1`。
+- 多 literal product term 成本為 `literal count + 1`。
+- 同一 product term 跨輸出重用時，每新增一個輸出連線增加 `1`。
+
+多輸出搜尋會在各函數的 Prime Implicant 候選聯集中找出精確最佳 cover；它不宣稱已
+枚舉所有可能的非 prime 共享 implicants。這是專案明確定義的教學／實驗成本模型，
+不等同特定 cell library、FPGA LUT 或工業 logic synthesis 的實際面積與 timing。
+
+### 限制
+
+- Exact minimization 具有組合爆炸；候選連線與覆蓋目標超過上限時會 fail fast。
+- 第一輪只處理 SOP，不含 POS、K-map 編輯器、Verilog 產生或 Espresso heuristic。
+- 本工具適合教學、小型函數與作品驗證，不取代 EDA 工具。
+- 歷史 `報告書.md` 與 `測資.md` 保留原專題脈絡；v2 的行為以程式測試與本 README 為準。
+
+### 本機開發
+
+需求：Node.js 24、npm 11。
+
+```bash
+npm ci
+npm run dev
+```
+
+完整驗證：
+
+```bash
+npm run check
+npx playwright install chromium
+npm run test:e2e
+```
+
+## 架構
+
+```mermaid
+flowchart LR
+  UI["Input UI"] --> V["Validation"]
+  V --> W["Web Worker"]
+  W --> Q["Quine–McCluskey"]
+  Q --> P["Petrick exact cover"]
+  P --> R["Structured result"]
+  R --> UI
+```
+
+核心目錄：
+
+```text
+src/
+├─ core/       # pure validation and minimization
+├─ worker/     # isolated solver execution
+├─ main.ts     # DOM controller and renderer
+└─ styles.css
+tests/
+├─ unit/
+├─ property/
+├─ regression/
+└─ e2e/
+```
+
+## English
+
+Boolean Logic Minimizer is a correctness-first, browser-local SOP minimizer. It generates prime
+implicants with Quine–McCluskey and solves the bounded prime-implicant cover with an exact
+Petrick-style branch-and-bound search.
+
+The v2 refactor separates validation, the pure TypeScript solver, Web Worker execution, UI and
+deployment. It includes exhaustive oracle checks for all 256 three-variable truth tables,
+regression coverage for legacy bugs, and Playwright browser tests.
+
+### Scope
+
+- 1–6 variables and up to 4 outputs.
+- Minterm and advanced supplied-prime input modes.
+- Explicit input and complexity errors.
+- A documented experimental multi-output sharing cost model.
+- Local-only computation and a versioned offline cache.
+
+This is an educational and portfolio tool for small Boolean functions. It is not an industrial
+logic-synthesis or EDA replacement.
+
+## License
+
+[MIT](LICENSE)
diff --git a/SECURITY.md b/SECURITY.md
new file mode 100644
index 0000000..156fbdc
--- /dev/null
+++ b/SECURITY.md
@@ -0,0 +1,13 @@
+# Security policy
+
+## Supported version
+
+Only the current `main` branch and deployed GitHub Pages version receive fixes.
+
+## Reporting
+
+Please use GitHub private vulnerability reporting when it is available. Do not include credentials,
+private truth tables or unrelated personal data in a public issue.
+
+This application performs all minimization locally in the browser and does not require an account,
+backend or API key.
diff --git a/android/android-launchericon-144-144.png b/android/android-launchericon-144-144.png
deleted file mode 100644
index 65426d2..0000000
Binary files a/android/android-launchericon-144-144.png and /dev/null differ
diff --git a/android/android-launchericon-192-192.png b/android/android-launchericon-192-192.png
deleted file mode 100644
index 0faa67f..0000000
Binary files a/android/android-launchericon-192-192.png and /dev/null differ
diff --git a/android/android-launchericon-48-48.png b/android/android-launchericon-48-48.png
deleted file mode 100644
index 2ccfd5b..0000000
Binary files a/android/android-launchericon-48-48.png and /dev/null differ
diff --git a/android/android-launchericon-512-512.png b/android/android-launchericon-512-512.png
deleted file mode 100644
index b50ba8e..0000000
Binary files a/android/android-launchericon-512-512.png and /dev/null differ
diff --git a/android/android-launchericon-72-72.png b/android/android-launchericon-72-72.png
deleted file mode 100644
index 91a14b7..0000000
Binary files a/android/android-launchericon-72-72.png and /dev/null differ
diff --git a/android/android-launchericon-96-96.png b/android/android-launchericon-96-96.png
deleted file mode 100644
index 9bb4cdb..0000000
Binary files a/android/android-launchericon-96-96.png and /dev/null differ
diff --git a/eslint.config.js b/eslint.config.js
new file mode 100644
index 0000000..f259d40
--- /dev/null
+++ b/eslint.config.js
@@ -0,0 +1,43 @@
+import eslint from '@eslint/js';
+import tseslint from 'typescript-eslint';
+
+export default tseslint.config(
+  {
+    ignores: [
+      'dist',
+      'coverage',
+      'playwright-report',
+      'test-results',
+      'legacy',
+      '*.config.js',
+      '*.config.d.ts'
+    ]
+  },
+  eslint.configs.recommended,
+  ...tseslint.configs.recommended,
+  {
+    rules: {
+      '@typescript-eslint/consistent-type-imports': 'error'
+    }
+  },
+  {
+    files: ['public/sw.js'],
+    languageOptions: {
+      globals: {
+        URL: 'readonly',
+        caches: 'readonly',
+        fetch: 'readonly',
+        self: 'readonly'
+      }
+    }
+  },
+  {
+    files: ['scripts/**/*.mjs'],
+    languageOptions: {
+      globals: {
+        document: 'readonly',
+        window: 'readonly'
+      }
+    }
+  }
+);
diff --git a/icons.json b/icons.json
deleted file mode 100644
index 9d9dbbf..0000000
--- a/icons.json
+++ /dev/null
@@ -1,452 +0,0 @@
-{
-  "icons": [
-    {
-      "src": "windows11/SmallTile.scale-100.png",
-      "sizes": "71x71"
-    },
-    {
-      "src": "windows11/SmallTile.scale-125.png",
-      "sizes": "89x89"
-    },
-    {
-      "src": "windows11/SmallTile.scale-150.png",
-      "sizes": "107x107"
-    },
-    {
-      "src": "windows11/SmallTile.scale-200.png",
-      "sizes": "142x142"
-    },
-    {
-      "src": "windows11/SmallTile.scale-400.png",
-      "sizes": "284x284"
-    },
-    {
-      "src": "windows11/Square150x150Logo.scale-100.png",
-      "sizes": "150x150"
-    },
-    {
-      "src": "windows11/Square150x150Logo.scale-125.png",
-      "sizes": "188x188"
-    },
-    {
-      "src": "windows11/Square150x150Logo.scale-150.png",
-      "sizes": "225x225"
-    },
-    {
-      "src": "windows11/Square150x150Logo.scale-200.png",
-      "sizes": "300x300"
-    },
-    {
-      "src": "windows11/Square150x150Logo.scale-400.png",
-      "sizes": "600x600"
-    },
-    {
-      "src": "windows11/Wide310x150Logo.scale-100.png",
-      "sizes": "310x150"
-    },
-    {
-      "src": "windows11/Wide310x150Logo.scale-125.png",
-      "sizes": "388x188"
-    },
-    {
-      "src": "windows11/Wide310x150Logo.scale-150.png",
-      "sizes": "465x225"
-    },
-    {
-      "src": "windows11/Wide310x150Logo.scale-200.png",
-      "sizes": "620x300"
-    },
-    {
-      "src": "windows11/Wide310x150Logo.scale-400.png",
-      "sizes": "1240x600"
-    },
-    {
-      "src": "windows11/LargeTile.scale-100.png",
-      "sizes": "310x310"
-    },
-    {
-      "src": "windows11/LargeTile.scale-125.png",
-      "sizes": "388x388"
-    },
-    {
-      "src": "windows11/LargeTile.scale-150.png",
-      "sizes": "465x465"
-    },
-    {
-      "src": "windows11/LargeTile.scale-200.png",
-      "sizes": "620x620"
-    },
-    {
-      "src": "windows11/LargeTile.scale-400.png",
-      "sizes": "1240x1240"
-    },
-    {
-      "src": "windows11/Square44x44Logo.scale-100.png",
-      "sizes": "44x44"
-    },
-    {
-      "src": "windows11/Square44x44Logo.scale-125.png",
-      "sizes": "55x55"
-    },
-    {
-      "src": "windows11/Square44x44Logo.scale-150.png",
-      "sizes": "66x66"
-    },
-    {
-      "src": "windows11/Square44x44Logo.scale-200.png",
-      "sizes": "88x88"
-    },
-    {
-      "src": "windows11/Square44x44Logo.scale-400.png",
-      "sizes": "176x176"
-    },
-    {
-      "src": "windows11/StoreLogo.scale-100.png",
-      "sizes": "50x50"
-    },
-    {
-      "src": "windows11/StoreLogo.scale-125.png",
-      "sizes": "63x63"
-    },
-    {
-      "src": "windows11/StoreLogo.scale-150.png",
-      "sizes": "75x75"
-    },
-    {
-      "src": "windows11/StoreLogo.scale-200.png",
-      "sizes": "100x100"
-    },
-    {
-      "src": "windows11/StoreLogo.scale-400.png",
-      "sizes": "200x200"
-    },
-    {
-      "src": "windows11/SplashScreen.scale-100.png",
-      "sizes": "620x300"
-    },
-    {
-      "src": "windows11/SplashScreen.scale-125.png",
-      "sizes": "775x375"
-    },
-    {
-      "src": "windows11/SplashScreen.scale-150.png",
-      "sizes": "930x450"
-    },
-    {
-      "src": "windows11/SplashScreen.scale-200.png",
-      "sizes": "1240x600"
-    },
-    {
-      "src": "windows11/SplashScreen.scale-400.png",
-      "sizes": "2480x1200"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-16.png",
-      "sizes": "16x16"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-20.png",
-      "sizes": "20x20"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-24.png",
-      "sizes": "24x24"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-30.png",
-      "sizes": "30x30"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-32.png",
-      "sizes": "32x32"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-36.png",
-      "sizes": "36x36"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-40.png",
-      "sizes": "40x40"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-44.png",
-      "sizes": "44x44"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-48.png",
-      "sizes": "48x48"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-60.png",
-      "sizes": "60x60"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-64.png",
-      "sizes": "64x64"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-72.png",
-      "sizes": "72x72"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-80.png",
-      "sizes": "80x80"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-96.png",
-      "sizes": "96x96"
-    },
-    {
-      "src": "windows11/Square44x44Logo.targetsize-256.png",
-      "sizes": "256x256"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-16.png",
-      "sizes": "16x16"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-20.png",
-      "sizes": "20x20"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-24.png",
-      "sizes": "24x24"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-30.png",
-      "sizes": "30x30"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-32.png",
-      "sizes": "32x32"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-36.png",
-      "sizes": "36x36"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-40.png",
-      "sizes": "40x40"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-44.png",
-      "sizes": "44x44"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-48.png",
-      "sizes": "48x48"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-60.png",
-      "sizes": "60x60"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-64.png",
-      "sizes": "64x64"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-72.png",
-      "sizes": "72x72"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-80.png",
-      "sizes": "80x80"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-96.png",
-      "sizes": "96x96"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-unplated_targetsize-256.png",
-      "sizes": "256x256"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-16.png",
-      "sizes": "16x16"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-20.png",
-      "sizes": "20x20"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-24.png",
-      "sizes": "24x24"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-30.png",
-      "sizes": "30x30"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-32.png",
-      "sizes": "32x32"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-36.png",
-      "sizes": "36x36"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-40.png",
-      "sizes": "40x40"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-44.png",
-      "sizes": "44x44"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-48.png",
-      "sizes": "48x48"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-60.png",
-      "sizes": "60x60"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-64.png",
-      "sizes": "64x64"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-72.png",
-      "sizes": "72x72"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-80.png",
-      "sizes": "80x80"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-96.png",
-      "sizes": "96x96"
-    },
-    {
-      "src": "windows11/Square44x44Logo.altform-lightunplated_targetsize-256.png",
-      "sizes": "256x256"
-    },
-    {
-      "src": "android/android-launchericon-512-512.png",
-      "sizes": "512x512"
-    },
-    {
-      "src": "android/android-launchericon-192-192.png",
-      "sizes": "192x192"
-    },
-    {
-      "src": "android/android-launchericon-144-144.png",
-      "sizes": "144x144"
-    },
-    {
-      "src": "android/android-launchericon-96-96.png",
-      "sizes": "96x96"
-    },
-    {
-      "src": "android/android-launchericon-72-72.png",
-      "sizes": "72x72"
-    },
-    {
-      "src": "android/android-launchericon-48-48.png",
-      "sizes": "48x48"
-    },
-    {
-      "src": "ios/16.png",
-      "sizes": "16x16"
-    },
-    {
-      "src": "ios/20.png",
-      "sizes": "20x20"
-    },
-    {
-      "src": "ios/29.png",
-      "sizes": "29x29"
-    },
-    {
-      "src": "ios/32.png",
-      "sizes": "32x32"
-    },
-    {
-      "src": "ios/40.png",
-      "sizes": "40x40"
-    },
-    {
-      "src": "ios/50.png",
-      "sizes": "50x50"
-    },
-    {
-      "src": "ios/57.png",
-      "sizes": "57x57"
-    },
-    {
-      "src": "ios/58.png",
-      "sizes": "58x58"
-    },
-    {
-      "src": "ios/60.png",
-      "sizes": "60x60"
-    },
-    {
-      "src": "ios/64.png",
-      "sizes": "64x64"
-    },
-    {
-      "src": "ios/72.png",
-      "sizes": "72x72"
-    },
-    {
-      "src": "ios/76.png",
-      "sizes": "76x76"
-    },
-    {
-      "src": "ios/80.png",
-      "sizes": "80x80"
-    },
-    {
-      "src": "ios/87.png",
-      "sizes": "87x87"
-    },
-    {
-      "src": "ios/100.png",
-      "sizes": "100x100"
-    },
-    {
-      "src": "ios/114.png",
-      "sizes": "114x114"
-    },
-    {
-      "src": "ios/120.png",
-      "sizes": "120x120"
-    },
-    {
-      "src": "ios/128.png",
-      "sizes": "128x128"
-    },
-    {
-      "src": "ios/144.png",
-      "sizes": "144x144"
-    },
-    {
-      "src": "ios/152.png",
-      "sizes": "152x152"
-    },
-    {
-      "src": "ios/167.png",
-      "sizes": "167x167"
-    },
-    {
-      "src": "ios/180.png",
-      "sizes": "180x180"
-    },
-    {
-      "src": "ios/192.png",
-      "sizes": "192x192"
-    },
-    {
-      "src": "ios/256.png",
-      "sizes": "256x256"
-    },
-    {
-      "src": "ios/512.png",
-      "sizes": "512x512"
-    },
-    {
-      "src": "ios/1024.png",
-      "sizes": "1024x1024"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/index.html b/index.html
index 09c67d6..337d803 100644
--- a/index.html
+++ b/index.html
@@ -1,2377 +1,145 @@
-<!DOCTYPE html>
-<html lang="zh-TW">
-<head>
-    <!-- 基本網頁設定 -->
-    <meta charset="UTF-8">
-    <meta name="viewport" content="width=device-width, initial-scale=1.0">
-    <title>多輸出布林函數最小化工具</title>
-    
-    <!-- PWA 支援設定 -->
-    <meta name="theme-color" content="#2c3e50">
-    <meta name="apple-mobile-web-app-capable" content="yes">
-    <meta name="apple-mobile-web-app-status-bar-style" content="black-translucent">
-    <meta name="apple-mobile-web-app-title" content="多輸出最小化工具">
-    
-    <!-- SEO 和網頁資訊設定 -->
-    <meta name="description" content="專業的多輸出布林函數最小化工具，支援 Patrick Method 演算法">
-    <meta name="keywords" content="Patrick Method, 邏輯最小化, 布爾代數, SOP, Prime Implicants, 多輸出">
-    <meta name="author" content="Logic Circuit Final Project">
-    
-    <!-- PWA 應用程式設定 -->
-    <link rel="manifest" href="manifest.json">
-    <meta name="mobile-web-app-capable" content="yes">
-    <meta name="apple-mobile-web-app-capable" content="yes">
-    <meta name="application-name" content="Boolean Minimizer">
-    <meta name="apple-mobile-web-app-title" content="Boolean Minimizer">
-    <meta name="msapplication-starturl" content="./index.html">
-    <link rel="icon" sizes="192x192" href="icon-192.png">
-    <link rel="apple-touch-icon" sizes="192x192" href="icon-192.png">
-    
-    <style>
-        /* 全域樣式重置 */
-        * {
-            margin: 0;
-            padding: 0;
-            box-sizing: border-box;
-        }
-        
-        /* 主體樣式設定 */
-        body {
-            font-family: 'Microsoft JhengHei', Arial, sans-serif;
-            background: linear-gradient(135deg, #667eea 0%, #764ba2 100%);
-            min-height: 100vh;
-            padding: 20px;
-        }
-        
-        .container {
-            max-width: 1400px;
-            margin: 0 auto;
-            background: white;
-            border-radius: 15px;
-            overflow: hidden;
-            box-shadow: 0 20px 40px rgba(0,0,0,0.15);
-        }
-        
-        .header {
-            background: linear-gradient(135deg, #2c3e50, #34495e);
-            color: white;
-            padding: 30px;
-            text-align: center;
-        }
-        
-        .header h1 {
-            font-size: 2.5em;
-            margin-bottom: 10px;
-        }
-        
-        .header p {
-            font-size: 1.1em;
-            opacity: 0.9;
-        }
-        
-        .main-content {
-            display: grid;
-            grid-template-columns: 1fr 1fr;
-            gap: 0;
-            min-height: 600px;
-        }
-        
-        .input-section {
-            padding: 30px;
-            background: #f8f9fa;
-            border-right: 1px solid #dee2e6;
-        }
-        
-        .output-section {
-            padding: 30px;
-            background: white;
-        }
-        
-        .section-title {
-            font-size: 1.5em;
-            color: #2c3e50;
-            margin-bottom: 20px;
-            padding-bottom: 10px;
-            border-bottom: 3px solid #74b9ff;
-        }
-        
-        .form-group {
-            margin-bottom: 25px;
-        }
-        
-        .form-label {
-            display: block;
-            font-weight: bold;
-            color: #2c3e50;
-            margin-bottom: 8px;
-            font-size: 1.1em;
-        }
-        
-        .input-mode-selector {
-            display: flex;
-            gap: 20px;
-            margin-bottom: 20px;
-        }
-        
-        .radio-group {
-            display: flex;
-            align-items: center;
-            gap: 8px;
-            padding: 12px 20px;
-            background: white;
-            border: 2px solid #ddd;
-            border-radius: 8px;
-            cursor: pointer;
-            transition: all 0.3s ease;
-        }
-        
-        .radio-group:hover {
-            border-color: #74b9ff;
-            background: #f1f8ff;
-        }
-        
-        .radio-group input[type="radio"]:checked {
-            accent-color: #74b9ff;
-        }
-        
-        .radio-group input[type="radio"]:checked + .radio-label {
-            color: #74b9ff;
-            font-weight: bold;
-        }
-        
-        .input-field {
-            width: 100%;
-            padding: 12px;
-            border: 2px solid #ddd;
-            border-radius: 8px;
-            font-size: 1em;
-            font-family: 'Courier New', monospace;
-            transition: border-color 0.3s ease;
-        }
-        
-        .input-field:focus {
-            outline: none;
-            border-color: #74b9ff;
-            box-shadow: 0 0 0 3px rgba(116, 185, 255, 0.1);
-        }
-        
-        .variable-input {
-            display: grid;
-            grid-template-columns: 1fr 100px;
-            gap: 10px;
-            align-items: end;
-        }
-        
-        .btn {
-            padding: 15px 30px;
-            border: none;
-            border-radius: 8px;
-            font-size: 1.1em;
-            font-weight: bold;
-            cursor: pointer;
-            transition: all 0.3s ease;
-            text-transform: uppercase;
-            letter-spacing: 1px;
-        }
-        
-        .btn-primary {
-            background: linear-gradient(135deg, #74b9ff, #0984e3);
-            color: white;
-            width: 100%;
-            margin: 20px 0;
-        }
-        
-        .btn-primary:hover {
-            background: linear-gradient(135deg, #0984e3, #0770d1);
-            transform: translateY(-2px);
-            box-shadow: 0 5px 15px rgba(0,0,0,0.2);
-        }
-        
-        .btn-secondary {
-            background: #6c757d;
-            color: white;
-            margin-right: 10px;
-            font-size: 0.9em;
-            padding: 10px 20px;
-            text-transform: none;
-            letter-spacing: normal;
-        }
-        
-        .btn-secondary:hover {
-            background: #545b62;
-            transform: translateY(-1px);
-            box-shadow: 0 4px 12px rgba(108, 117, 125, 0.3);
-        }
-        
-        .button-group {
-            margin: 20px 0;
-            display: flex;
-            gap: 10px;
-            align-items: center;
-            flex-wrap: wrap;
-        }
-        
-        .button-group .btn {
-            flex: 1;
-            min-width: 140px;
-        }
-        
-        .button-group .btn-primary {
-            margin: 0;
-            width: auto;
-        }
-        
-        .btn-info {
-            background: #17a2b8;
-            color: white;
-            margin-right: 10px;
-            font-size: 0.9em;
-            padding: 10px 20px;
-            text-transform: none;
-            letter-spacing: normal;
-        }
-        
-        .btn-info:hover {
-            background: #138496;
-            transform: translateY(-1px);
-        }
-        
-        .btn-add {
-            background: #28a745;
-            color: white;
-            font-size: 0.9em;
-            padding: 10px 20px;
-            text-transform: none;
-            letter-spacing: normal;
-        }
-        
-        .btn-add:hover {
-            background: #218838;
-        }
-        
-        .btn-remove {
-            background: #dc3545;
-            color: white;
-            font-size: 0.8em;
-            padding: 6px 12px;
-            text-transform: none;
-            letter-spacing: normal;
-        }
-        
-        .btn-remove:hover {
-            background: #c82333;
-        }
-        
-        /* 函數動態輸入框樣式 */
-        .function-input-row {
-            display: flex;
-            flex-direction: column;
-            margin-bottom: 15px;
-            padding: 15px;
-            background: white;
-            border-radius: 8px;
-            border-left: 4px solid #007bff;
-            box-shadow: 0 2px 4px rgba(0,0,0,0.1);
-        }
-        
-        .function-header {
-            display: flex;
-            align-items: center;
-            justify-content: space-between;
-            margin-bottom: 10px;
-        }
-        
-        .function-label {
-            font-weight: bold;
-            color: #495057;
-            font-size: 16px;
-        }
-        
-        .function-inputs {
-            display: flex;
-            gap: 15px;
-            align-items: center;
-            flex-wrap: wrap;
-        }
-        
-        .function-input-group {
-            display: flex;
-            align-items: center;
-            gap: 8px;
-        }
-        
-        .function-input {
-            padding: 8px 12px;
-            border: 2px solid #e9ecef;
-            border-radius: 6px;
-            font-family: 'Courier New', monospace;
-            font-size: 14px;
-            transition: border-color 0.3s ease;
-            min-width: 120px;
-        }
-        
-                    .function-input:focus {
-                outline: none;
-                border-color: #007bff;
-                box-shadow: 0 0 0 0.2rem rgba(0, 123, 255, 0.25);
-            }
-            
-            textarea:focus {
-                outline: none;
-                border-color: #007bff !important;
-                box-shadow: 0 0 0 0.2rem rgba(0, 123, 255, 0.25);
-            }
-        
-        .function-input-label {
-            font-size: 14px;
-            color: #495057;
-            white-space: nowrap;
-            font-weight: 500;
-        }
-        
-        /* PI 動態輸入框樣式 */
-        .function-pi-group {
-            background: white;
-            border-radius: 8px;
-            margin-bottom: 15px;
-            border-left: 4px solid #28a745;
-            overflow: hidden;
-            box-shadow: 0 2px 4px rgba(0,0,0,0.1);
-        }
-        
-        .function-pi-header {
-            display: flex;
-            align-items: center;
-            justify-content: space-between;
-            padding: 12px 15px;
-            background: #e9ecef;
-            border-bottom: 1px solid #dee2e6;
-        }
-        
-        .function-pi-title {
-            margin: 0;
-            font-size: 16px;
-            color: #495057;
-            cursor: pointer;
-            user-select: none;
-            display: flex;
-            align-items: center;
-            gap: 8px;
-            font-weight: bold;
-        }
-        
-        .function-pi-title:hover {
-            color: #007bff;
-        }
-        
-        .function-pi-indicator {
-            color: #6c757d;
-            font-size: 12px;
-            transition: color 0.3s ease;
-        }
-        
-        .function-pi-indicator.active {
-            color: #28a745;
-        }
-        
-        .function-pi-inputs {
-            padding: 15px;
-        }
-        
-        .pi-input-row {
-            display: flex;
-            align-items: center;
-            margin-bottom: 10px;
-            gap: 10px;
-        }
-        
-        .pi-label {
-            font-weight: bold;
-            color: #495057;
-            min-width: 50px;
-            font-size: 14px;
-        }
-        
-        .pi-input {
-            flex: 1;
-            padding: 8px 12px;
-            border: 2px solid #e9ecef;
-            border-radius: 6px;
-            font-family: 'Courier New', monospace;
-            font-size: 14px;
-            transition: border-color 0.3s ease;
-        }
-        
-        .pi-input:focus {
-            outline: none;
-            border-color: #007bff;
-            box-shadow: 0 0 0 0.2rem rgba(0, 123, 255, 0.25);
-        }
-        
-        .result-area {
-            min-height: 300px;
-            background: #f8f9fa;
-            border: 2px dashed #dee2e6;
-            border-radius: 8px;
-            padding: 20px;
-            font-family: 'Courier New', monospace;
-            font-size: 1em;
-            overflow-y: auto;
-            white-space: pre-wrap;
-        }
-        
-        .result-area.has-content {
-            background: white;
-            border: 2px solid #28a745;
-        }
-        
-        .loading {
-            display: none;
-            text-align: center;
-            padding: 50px;
-            color: #6c757d;
-        }
-        
-        .loading.show {
-            display: block;
-        }
-        
-        .spinner {
-            border: 4px solid #f3f3f3;
-            border-top: 4px solid #74b9ff;
-            border-radius: 50%;
-            width: 40px;
-            height: 40px;
-            animation: spin 1s linear infinite;
-            margin: 0 auto 20px;
-        }
-        
-        @keyframes spin {
-            0% { transform: rotate(0deg); }
-            100% { transform: rotate(360deg); }
-        }
-        
-        .example-section {
-            background: #e8f4f8;
-            border: 1px solid #b8daff;
-            border-radius: 8px;
-            padding: 15px;
-            margin-top: 20px;
-        }
-        
-        .example-title {
-            font-weight: bold;
-            color: #0c5460;
-            margin-bottom: 10px;
-        }
-        
-        .example-content {
-            font-family: 'Courier New', monospace;
-            font-size: 0.9em;
-            color: #0c5460;
-            line-height: 1.4;
-        }
-        
-        /* 手機版響應式設計 */
-        @media (max-width: 768px) {
-            .container {
-                margin: 10px;
-                border-radius: 10px;
-            }
-            
-            .header {
-                padding: 20px 15px;
-            }
-            
-            .header h1 {
-                font-size: 1.8em;
-                margin-bottom: 8px;
-            }
-            
-            .header p {
-                font-size: 0.95em;
-            }
-            
-            .main-content {
-                grid-template-columns: 1fr;
-                min-height: auto;
-            }
-            
-            .input-section, .output-section {
-                padding: 20px 15px;
-            }
-            
-            .input-section {
-                border-right: none;
-                border-bottom: 1px solid #dee2e6;
-            }
-            
-            .section-title {
-                font-size: 1.3em;
-                margin-bottom: 15px;
-            }
-            
-            .form-group {
-                margin-bottom: 20px;
-            }
-            
-            .input-mode-selector {
-                flex-direction: column;
-                gap: 10px;
-            }
-            
-            .radio-group {
-                padding: 10px 15px;
-                font-size: 0.9em;
-            }
-            
-            .variable-input {
-                grid-template-columns: 1fr;
-                gap: 10px;
-            }
-            
-            .btn {
-                padding: 12px 20px;
-                font-size: 0.95em;
-                letter-spacing: 0.5px;
-                white-space: nowrap;
-                overflow: hidden;
-                text-overflow: ellipsis;
-            }
-            
-            .button-group {
-                flex-direction: column;
-                gap: 8px;
-                margin: 15px 0;
-            }
-            
-            .button-group .btn {
-                flex: none;
-                min-width: auto;
-                width: 100%;
-                margin: 0;
-            }
-            
-            .btn-secondary {
-                font-size: 0.85em;
-                padding: 10px 15px;
-                margin-right: 0;
-            }
-            
-            .function-pi-header {
-                padding: 10px 12px;
-                flex-direction: column !important;
-                gap: 8px;
-                align-items: stretch !important;
-                justify-content: flex-start !important;
-            }
-            
-            .function-pi-title {
-                font-size: 0.9em;
-                flex: none !important;
-                min-width: auto !important;
-                width: 100% !important;
-                text-align: left;
-                margin-bottom: 8px;
-            }
-            
-            .function-pi-header .btn-remove {
-                width: 100% !important;
-                margin: 0 !important;
-                font-size: 0.8em;
-                padding: 8px 12px;
-                flex: none !important;
-            }
-            
-            .function-pi-inputs {
-                padding: 12px;
-            }
-            
-            .pi-input-row {
-                flex-direction: column !important;
-                gap: 8px;
-                margin-bottom: 12px;
-                align-items: stretch !important;
-            }
-            
-            .pi-label {
-                min-width: auto !important;
-                font-size: 0.85em;
-                width: 100%;
-                margin-bottom: 5px;
-            }
-            
-            .pi-input-row .pi-input {
-                width: 100% !important;
-                margin: 0 !important;
-                box-sizing: border-box;
-                flex: none !important;
-            }
-            
-            .pi-input-row .btn {
-                width: 100% !important;
-                margin: 5px 0 0 0 !important;
-                font-size: 0.8em;
-                padding: 8px 12px;
-                flex: none !important;
-            }
-            
-            .function-input-row {
-                padding: 12px;
-                margin-bottom: 12px;
-            }
-            
-            .function-inputs {
-                flex-direction: column;
-                gap: 10px;
-                align-items: stretch;
-            }
-            
-            .function-input-group {
-                flex-direction: column;
-                align-items: flex-start;
-                gap: 5px;
-            }
-            
-            .function-input {
-                min-width: auto !important;
-                width: 100% !important;
-                font-size: 0.9em;
-                margin: 0 !important;
-                box-sizing: border-box;
-            }
-            
-            .function-input-label {
-                font-size: 0.85em;
-            }
-            
-            .example-section {
-                margin-top: 15px;
-            }
-            
-            .example-title {
-                font-size: 1em;
-                padding: 8px 12px;
-            }
-            
-            .example-content {
-                padding: 12px;
-                font-size: 0.8em;
-                line-height: 1.4;
-            }
-            
-            .loading {
-                padding: 20px 15px;
-            }
-            
-            .result-area {
-                padding: 15px;
-            }
-            
-            .progress-details {
-                margin-top: 15px;
-            }
-            
-            .progress-box {
-                padding: 12px;
-            }
-            
-            .progress-box h4 {
-                font-size: 1em;
-                margin-bottom: 8px;
-            }
-            
-            /* PI 輸入區域的按鈕組 */
-            #piInputContainer div[style*="display: flex"] {
-                display: flex !important;
-                flex-direction: column !important;
-                gap: 8px !important;
-                margin-top: 15px;
-            }
-            
-            #piInputContainer div[style*="display: flex"] .btn {
-                flex: none !important;
-                width: 100% !important;
-                min-width: auto !important;
-                font-size: 0.8em;
-                padding: 10px 15px;
-                margin: 0 !important;
-                white-space: nowrap;
-                overflow: hidden;
-                text-overflow: ellipsis;
-                box-sizing: border-box;
-            }
-            
-            /* 特別針對三個按鈕 */
-            .btn-add, .btn-secondary, .btn-info {
-                width: 100% !important;
-                margin: 0 !important;
-                margin-bottom: 8px !important;
-            }
-        }
-        
-        /* 強制修復 PI 模式手機版問題 */
-        @media (max-width: 768px) {
-            /* 強制修復 PI 模式底部按鈕組 */
-            #piInputContainer > div[style*="display: flex"] {
-                display: flex !important;
-                flex-direction: column !important;
-                align-items: stretch !important;
-                gap: 8px !important;
-                margin-top: 15px !important;
-            }
-            
-            #piInputContainer > div[style*="display: flex"] .btn {
-                width: 100% !important;
-                margin: 0 !important;
-                white-space: nowrap !important;
-                overflow: hidden !important;
-                text-overflow: ellipsis !important;
-                box-sizing: border-box !important;
-            }
-            
-            /* 強制修復函數標題區域 */
-            .function-pi-group .function-pi-header {
-                display: flex !important;
-                flex-direction: column !important;
-                align-items: stretch !important;
-                padding: 10px !important;
-            }
-            
-            .function-pi-group .function-pi-header .function-pi-title {
-                width: 100% !important;
-                margin-bottom: 8px !important;
-            }
-            
-            .function-pi-group .function-pi-header .btn-remove {
-                width: 100% !important;
-                margin: 0 !important;
-                white-space: nowrap !important;
-                overflow: hidden !important;
-                text-overflow: ellipsis !important;
-            }
-            
-            /* 強制修復 PI 輸入行 */
-            .function-pi-inputs .pi-input-row {
-                display: flex !important;
-                flex-direction: column !important;
-                align-items: stretch !important;
-                gap: 5px !important;
-            }
-            
-            .function-pi-inputs .pi-input-row .pi-label {
-                display: block !important;
-                margin-bottom: 4px !important;
-                font-weight: bold !important;
-            }
-            
-            .function-pi-inputs .pi-input-row .pi-input {
-                width: 100% !important;
-                margin: 0 !important;
-                box-sizing: border-box !important;
-            }
-            
-            .function-pi-inputs .pi-input-row .btn {
-                width: 100% !important;
-                margin: 0 !important;
-                white-space: nowrap !important;
-                overflow: hidden !important;
-                text-overflow: ellipsis !important;
-            }
-        }
-        
-        /* 超強制修復 PI 模式問題 - 使用更高優先級 */
-        @media (max-width: 768px) {
-            /* 針對 PI 模式底部按鈕的超強制修復 - 修正選擇器 */
-            #piInputContainer > div[style*="display: flex"][style*="gap: 10px"][style*="margin-top: 15px"] {
-                display: flex !important;
-                flex-direction: column !important;
-                align-items: stretch !important;
-                gap: 8px !important;
-                margin-top: 15px !important;
-            }
-            
-            #piInputContainer > div[style*="display: flex"] button {
-                width: 100% !important;
-                margin: 0 !important;
-                flex: none !important;
-                box-sizing: border-box !important;
-            }
-            
-            /* 針對所有 PI 相關按鈕的超強制修復 */
-            .btn[onclick*="addFunctionPIGroup"],
-            .btn[onclick*="addPIToCurrentFunction"],
-            .btn[onclick*="generateFunctionDefinitions"],
-            .btn[onclick*="removeFunctionPIGroup"],
-            .btn[onclick*="removePIFromFunction"] {
-                width: 100% !important;
-                margin: 0 !important;
-                white-space: nowrap !important;
-                overflow: hidden !important;
-                text-overflow: ellipsis !important;
-                box-sizing: border-box !important;
-            }
-            
-            /* 最終保險 - 直接針對 piInputContainer 內的所有 flex 容器 */
-            #piInputContainer div[style*="display: flex"] {
-                flex-direction: column !important;
-                align-items: stretch !important;
-            }
-            
-            #piInputContainer div[style*="display: flex"] .btn {
-                width: 100% !important;
-                margin: 0 0 8px 0 !important;
-                flex: none !important;
-            }
-            
-            /* 768px 終極修復 - 直接針對三個具體按鈕 */
-            button[onclick="addFunctionPIGroup()"],
-            button[onclick="addPIToCurrentFunction()"],
-            button[onclick="generateFunctionDefinitions()"] {
-                width: 100% !important;
-                margin: 0 0 8px 0 !important;
-                display: block !important;
-                flex: none !important;
-                box-sizing: border-box !important;
-            }
-        }
-        
-        /* 更小螢幕的額外優化 */
-        @media (max-width: 480px) {
-            .container {
-                margin: 5px;
-                border-radius: 8px;
-            }
-            
-            .header {
-                padding: 15px 10px;
-            }
-            
-            .header h1 {
-                font-size: 1.5em;
-            }
-            
-            .header p {
-                font-size: 0.9em;
-            }
-            
-            .input-section, .output-section {
-                padding: 15px 10px;
-            }
-            
-            .section-title {
-                font-size: 1.2em;
-            }
-            
-            .btn {
-                padding: 10px 15px;
-                font-size: 0.9em;
-            }
-            
-            .function-pi-title {
-                font-size: 0.85em;
-                min-width: 150px;
-            }
-            
-            .example-content {
-                font-size: 0.75em;
-            }
-            
-            #multiplePIInputs + div .btn {
-                min-width: auto;
-                font-size: 0.75em;
-                padding: 8px 12px;
-                width: 100%;
-            }
-            
-            .function-pi-header {
-                flex-direction: column;
-                gap: 6px;
-            }
-            
-            .btn-remove {
-                font-size: 0.7em;
-                padding: 6px 10px;
-            }
-            
-            .pi-input-row .btn {
-                font-size: 0.7em;
-                padding: 6px 10px;
-            }
-            
-            .radio-group {
-                padding: 8px 12px;
-                font-size: 0.85em;
-            }
-            
-            /* 480px 以下的 PI 模式超強制修復 */
-            div[style*="display: flex"] {
-                flex-direction: column !important;
-                align-items: stretch !important;
-            }
-            
-            div[style*="display: flex"] .btn {
-                width: 100% !important;
-                margin: 2px 0 !important;
-                flex: none !important;
-            }
-            
-            /* 終極修復 - 直接針對三個具體按鈕 */
-            button[onclick="addFunctionPIGroup()"],
-            button[onclick="addPIToCurrentFunction()"],
-            button[onclick="generateFunctionDefinitions()"] {
-                width: 100% !important;
-                margin: 0 0 8px 0 !important;
-                display: block !important;
-                flex: none !important;
-                box-sizing: border-box !important;
-            }
-        }
-    </style>
-</head>
-<body>
-    <div class="container">
-        <!-- 標題區域 -->
-        <div class="header">
-            <h1>🧮 多輸出布林函數最小化工具</h1>
-            <p>基於 Patrick Method 演算法的多輸出最佳化系統</p>
+<!doctype html>
+<html lang="zh-Hant">
+  <head>
+    <meta charset="UTF-8" />
+    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
+    <meta name="description" content="可驗證的 Quine–McCluskey 與 Petrick 布林函數最小化工具。" />
+    <meta name="theme-color" content="#17223b" />
+    <meta property="og:title" content="Boolean Logic Minimizer" />
+    <meta
+      property="og:description"
+      content="Exact Boolean minimization with explicit limits, validation and reproducible tests."
+    />
+    <meta
+      property="og:image"
+      content="https://bigsticktw.github.io/boolean-function-minimizer/social-preview.png"
+    />
+    <meta name="twitter:card" content="summary_large_image" />
+    <title>Boolean Logic Minimizer</title>
+    <link rel="icon" href="./icon.svg" type="image/svg+xml" />
+    <link rel="manifest" href="./manifest.webmanifest" />
+  </head>
+  <body>
+    <a class="skip-link" href="#workspace">跳到輸入區</a>
+    <header class="site-header">
+      <div class="header-copy">
+        <p class="eyebrow">DIGITAL LOGIC · EXACT MODE</p>
+        <h1>Boolean Logic Minimizer</h1>
+        <p class="lede">
+          用 Quine–McCluskey 產生 Prime Implicants，再以 Petrick cover 找出可驗證的最小 SOP。
+        </p>
+      </div>
+      <div class="guarantee-card" aria-label="目前求解保證">
+        <span class="status-dot"></span>
+        <div>
+          <strong>Exact prime cover</strong>
+          <span>候選圖內精確；最多 6 個變數、4 個輸出</span>
         </div>
-        
-        <!-- 主要內容區域 -->
-        <div class="main-content">
-            <!-- 輸入區域 -->
-            <div class="input-section">
-                <h2 class="section-title">📝 輸入設定</h2>
-                
-                <!-- 變數設定 -->
-                <div class="form-group">
-                    <label class="form-label">變數設定</label>
-                    <div class="variable-input">
-                        <input type="text" class="input-field" id="variables" 
-                               placeholder="輸入變數 (例如: A,B,C,D 或 W,X,Y,Z)" value="A,B,C,D">
-                        <button class="btn btn-secondary" onclick="clearInputs()">清除</button>
-                    </div>
-                </div>
-                
-                <!-- 輸入模式選擇 -->
-                <div class="form-group">
-                    <label class="form-label">輸入模式</label>
-                    <div class="input-mode-selector">
-                        <label class="radio-group">
-                            <input type="radio" name="inputMode" value="pi" id="modePI" checked>
-                            <span class="radio-label">Prime Implicants (PI)</span>
-                        </label>
-                        <label class="radio-group">
-                            <input type="radio" name="inputMode" value="minterm" id="modeMinterm">
-                            <span class="radio-label">Minterms</span>
-                        </label>
-                    </div>
-                </div>
-                
-                <!-- 輸入區域 -->
-                <div class="form-group">
-                    <label class="form-label" id="inputLabel">多函數 Prime Implicants</label>
-                    
-                    <!-- PI 模式：動態輸入框 -->
-                    <div id="piInputContainer">
-                        <div id="multiplePIInputs">
-                            <!-- 動態生成的函數PI區域將在這裡 -->
-                        </div>
-                        <div style="display: flex; gap: 10px; margin-top: 15px;">
-                            <button type="button" class="btn btn-add" onclick="addFunctionPIGroup()">
-                                ➕ 新增函數
-                            </button>
-                            <button type="button" class="btn btn-secondary" onclick="addPIToCurrentFunction()">
-                                ➕ 新增 PI
-                            </button>
-                            <button type="button" class="btn btn-info" onclick="generateFunctionDefinitions()">
-                                🔄 自動生成函數定義
-                            </button>
-                        </div>
-                        
-                        <!-- 輸出函數定義輸入區域 -->
-                        <div style="margin-top: 25px;">
-                            <label style="display: block; font-weight: bold; color: #2c3e50; margin-bottom: 8px; font-size: 1.1em;">
-                                輸出函數定義 (各自函數的minterm，不含don't care)
-                            </label>
-                            <textarea id="outputFunctions" 
-                                      placeholder="定義各輸出函數:&#10;F1: 0,2,4&#10;F2: 1,3,5&#10;F3: 2,6,7&#10;&#10;或使用傳統格式:&#10;F1: m0,m2,m4&#10;F2: m1,m3,m5&#10;F3: m2,m6,m7"
-                                      style="width: 100%; min-height: 120px; resize: vertical; padding: 12px; border: 2px solid #ddd; border-radius: 8px; font-family: 'Courier New', monospace; font-size: 14px; transition: border-color 0.3s ease;"></textarea>
-                            <div style="margin-top: 8px; padding: 10px; background: #e8f4f8; border-radius: 6px; font-size: 13px; color: #0c5460;">
-                                💡 <strong>輸入格式:</strong> 支援純數字格式 (F1: 0,2,4) 或傳統格式 (F1: m0,m2,m4)<br>
-                                🧠 <strong>自動共享項檢測:</strong> 系統會自動分析PI數據，找出函數間的共享項
-                            </div>
-                        </div>
-                    </div>
-                    
-                    <!-- Minterm 模式：函數輸入 -->
-                    <div id="mintermInputContainer" style="display: none;">
-                        <div id="functionInputs">
-                            <!-- 動態生成的函數輸入框將在這裡 -->
-                        </div>
-                        <button type="button" class="btn btn-add" id="addFunctionButton" onclick="addFunctionInput()">
-                            ➕ 新增函數
-                        </button>
-                    </div>
-                </div>
-                
-                <!-- 執行按鈕 -->
-                <div class="button-group" style="display: flex; gap: 10px; align-items: center;">
-                    <button class="btn btn-primary" onclick="runMultiOutputOptimization()">
-                        🚀 執行多輸出最佳化
-                    </button>
-                    <button class="btn btn-secondary" onclick="shareResults()" title="分享結果">
-                        📤 分享結果
-                    </button>
-                    <button class="btn btn-secondary" onclick="copyResultsToClipboard()" title="複製結果">
-                        📋 複製結果
-                    </button>
-                </div>
-                
-                <!-- 範例區域 -->
-                <div class="example-section">
-                    <div class="example-title">💡 輸入格式說明</div>
-                    <div class="example-content">
-<strong>Prime Implicants 模式:</strong>
-變數: W,X,Y,Z
-函數 F1:
-  PI1: 00-1  (覆蓋 m1,m9)
-  PI2: -110  (覆蓋 m6,m14)
-函數 F2:
-  PI1: 000-  (覆蓋 m0,m1)
-  PI2: 01--  (覆蓋 m4,m5,m6,m7)
+      </div>
+    </header>
 
-<strong>Minterms 模式:</strong>
-變數: W,X,Y,Z
-F1 = Σm(1,5,7,8,10,11,12,14,15) + Σd(3,13)
-F2 = Σm(0,1,4,6,7,8,12) + Σd(2,9)
+    <main id="workspace" class="workspace">
+      <section class="panel input-panel" aria-labelledby="input-title">
+        <div class="section-heading">
+          <div>
+            <p class="section-index">01 / DEFINE</p>
+            <h2 id="input-title">定義函數</h2>
+          </div>
+          <button id="clear-button" class="button button-ghost" type="button">清除</button>
+        </div>
 
-<strong>特色功能:</strong>
-• 🎯 自動檢測函數間的共享 Prime Implicants
-• ⚡ 智能最佳化，減少總體電路成本
-• 🔧 支援 Don't Care 項優化
-• 📊 詳細顯示最佳化步驟和結果比較
-                    </div>
-                </div>
-            </div>
-            
-            <!-- 輸出區域 -->
-            <div class="output-section">
-                <h2 class="section-title">📊 最佳化結果</h2>
-                
-                <!-- 載入動畫 -->
-                <div class="loading" id="loadingArea">
-                    <div class="spinner"></div>
-                    <p>正在執行多輸出最佳化演算法...</p>
-                    
-                    <!-- 進度詳情框 -->
-                    <div class="progress-details" id="progressDetails" style="display: none;">
-                        <div class="progress-box">
-                            <h4>🔍 運算進度詳情</h4>
-                            <div class="progress-content" id="progressContent">
-                                <!-- 進度信息將在這裡顯示 -->
-                            </div>
-                        </div>
-                    </div>
-                </div>
-                
-                <!-- 結果顯示區域 -->
-                <div class="result-area" id="resultArea">
-                    <div style="text-align: center; color: #6c757d; margin-top: 100px;">
-                        <h3>等待輸入...</h3>
-                        <p>請在左側輸入多輸出函數資料並點擊執行按鈕</p>
-                        <p style="margin-top: 20px;">🔹 支援 Prime Implicants 和 Minterms 兩種輸入模式</p>
-                        <p>🔹 自動最佳化多函數共享項</p>
-                        <p>🔹 顯示詳細最佳化過程</p>
-                    </div>
-                </div>
-            </div>
+        <div class="field">
+          <label for="variables">變數</label>
+          <input
+            id="variables"
+            data-testid="variables"
+            type="text"
+            value="A,B,C"
+            autocomplete="off"
+            spellcheck="false"
+          />
+          <p class="field-hint">以逗號分隔；Exact mode 最多 6 個變數。</p>
         </div>
-    </div>
-    
-    <!-- 載入核心算法 -->
-    <script src="patrick-method-core.js"></script>
-    
-    <!-- 註冊 Service Worker -->
-    <script>
-        if ('serviceWorker' in navigator) {
-            window.addEventListener('load', function() {
-                navigator.serviceWorker.register('./sw.js')
-                    .then(function(registration) {
-                        console.log('SW registered: ', registration);
-                    })
-                    .catch(function(registrationError) {
-                        console.log('SW registration failed: ', registrationError);
-                    });
-            });
-        }
-    </script>
-    
-    <script>
-        // ==================== 全域變數定義 ====================
-        let functionPICounter = 1;           // PI 模式下的函數計數器
-        let piCounterByFunction = {};        // 每個函數的 PI 計數器對應表
-        let currentSelectedFunction = 1;     // 當前選中的函數 ID
-        let functionCounter = 1;             // Minterm 模式下的函數計數器
-        
-        // ==================== 輸入模式切換處理 ====================
-        // 監聽輸入模式選項的變化
-        document.querySelectorAll('input[name="inputMode"]').forEach(radio => {
-            radio.addEventListener('change', function() {
-                updateInputMode(this.value);
-            });
-        });
-        
-        /**
-         * 更新輸入模式顯示
-         * 根據選擇的模式（PI 或 Minterm）切換對應的輸入界面
-         * @param {string} mode - 輸入模式 ('pi' 或 'minterm')
-         */
-        function updateInputMode(mode) {
-            const inputLabel = document.getElementById('inputLabel');
-            const piContainer = document.getElementById('piInputContainer');
-            const mintermContainer = document.getElementById('mintermInputContainer');
-            
-            if (mode === 'pi') {
-                // 切換到 PI 模式
-                inputLabel.textContent = '多函數 Prime Implicants';
-                piContainer.style.display = 'block';
-                mintermContainer.style.display = 'none';
-                
-                // 如果尚未初始化，則初始化 PI 輸入框
-                if (document.getElementById('multiplePIInputs').children.length === 0) {
-                    initializeMultiplePIInputs();
-                }
-            } else {
-                // 切換到 Minterm 模式
-                inputLabel.textContent = '多函數 Minterms';
-                piContainer.style.display = 'none';
-                mintermContainer.style.display = 'block';
-                
-                // 如果尚未初始化，則初始化 Minterm 輸入框
-                if (document.getElementById('functionInputs').children.length === 0) {
-                    initializeFunctionInputs();
-                }
-            }
-        }
-        
-        /**
-         * 初始化多輸出 PI 輸入框
-         * 清空現有內容並重置所有計數器，然後添加第一個函數組
-         */
-        function initializeMultiplePIInputs() {
-            const multiplePIInputs = document.getElementById('multiplePIInputs');
-            multiplePIInputs.innerHTML = '';
-            functionPICounter = 1;
-            piCounterByFunction = {};
-            currentSelectedFunction = 1;
-            addFunctionPIGroup(); // 添加第一個函數組
-        }
-        
-        /**
-         * 新增函數 PI 組
-         * 創建一個新的函數組，包含標題、PI 輸入區域和控制按鈕
-         */
-        function addFunctionPIGroup() {
-            const multiplePIInputs = document.getElementById('multiplePIInputs');
-            
-            // 計算當前應該的函數編號（從 1 開始，連續編號）
-            const currentFunctionCount = multiplePIInputs.children.length;
-            const functionDisplayId = currentFunctionCount + 1;
-            const functionId = functionPICounter++;
-            piCounterByFunction[functionId] = 1;
-            
-            const functionDiv = document.createElement('div');
-            functionDiv.className = 'function-pi-group';
-            functionDiv.id = `functionPIGroup${functionId}`;
-            functionDiv.setAttribute('data-display-id', functionDisplayId);
-            
-            functionDiv.innerHTML = `
-                <div class="function-pi-header">
-                    <h4 class="function-pi-title" onclick="selectFunction(${functionId})">
-                        📝 函數 F${functionDisplayId}
-                        <span class="function-pi-indicator" id="indicator${functionId}">● PI 數量: 0</span>
-                    </h4>
-                    <button class="btn btn-remove" onclick="removeFunctionPIGroup(${functionId})">
-                        ✕ 移除函數
-                    </button>
-                </div>
-                <div class="function-pi-inputs" id="functionPIInputs${functionId}">
-                    <!-- PI 輸入框將在這裡 -->
-                </div>
-            `;
-            
-            multiplePIInputs.appendChild(functionDiv);
-            
-            // 選中新創建的函數
-            selectFunction(functionId);
-            
-            // 為新函數添加第一個PI
-            addPIToFunction(functionId);
-        }
-        
-        // 移除函數 PI 組
-        function removeFunctionPIGroup(functionId) {
-            if (Object.keys(piCounterByFunction).length <= 1) {
-                alert('至少需要保留一個函數！');
-                return;
-            }
-            
-            const functionDiv = document.getElementById(`functionPIGroup${functionId}`);
-            functionDiv.remove();
-            delete piCounterByFunction[functionId];
-            
-            // 重新整理所有函數的編號
-            updatePIFunctionNumbers();
-            
-            // 如果移除的是當前選中的函數，選中第一個可用的函數
-            if (currentSelectedFunction === functionId) {
-                const remainingFunctions = Object.keys(piCounterByFunction);
-                if (remainingFunctions.length > 0) {
-                    selectFunction(parseInt(remainingFunctions[0]));
-                }
-            }
-        }
-        
-        // 重新整理 PI 模式下所有函數的編號
-        function updatePIFunctionNumbers() {
-            const multiplePIInputs = document.getElementById('multiplePIInputs');
-            const functionGroups = multiplePIInputs.querySelectorAll('.function-pi-group');
-            
-            functionGroups.forEach((group, index) => {
-                const displayId = index + 1;
-                group.setAttribute('data-display-id', displayId);
-                
-                // 更新函數標題
-                const functionTitle = group.querySelector('.function-pi-title');
-                if (functionTitle) {
-                    const titleText = functionTitle.childNodes[0];
-                    if (titleText) {
-                        titleText.textContent = `📝 函數 F${displayId}`;
-                    }
-                }
-            });
-        }
-        
-        // 選中函數
-        function selectFunction(functionId) {
-            // 移除之前的選中狀態
-            document.querySelectorAll('.function-pi-group').forEach(group => {
-                group.style.borderLeftColor = '#28a745';
-            });
-            
-            // 設置新的選中狀態
-            const selectedGroup = document.getElementById(`functionPIGroup${functionId}`);
-            if (selectedGroup) {
-                selectedGroup.style.borderLeftColor = '#007bff';
-                currentSelectedFunction = functionId;
-            }
-        }
-        
-        // 為當前選中的函數新增 PI
-        function addPIToCurrentFunction() {
-            if (currentSelectedFunction && piCounterByFunction[currentSelectedFunction] !== undefined) {
-                addPIToFunction(currentSelectedFunction);
-            } else {
-                alert('請先選擇一個函數！');
-            }
-        }
-        
-        // 為指定函數新增 PI
-        function addPIToFunction(functionId) {
-            const functionPIInputs = document.getElementById(`functionPIInputs${functionId}`);
-            
-            // 計算當前應該的 PI 編號（從1開始，連續編號）
-            const currentPICount = functionPIInputs.children.length;
-            const piDisplayId = currentPICount + 1;
-            const piId = piCounterByFunction[functionId]++;
-            
-            const piRow = document.createElement('div');
-            piRow.className = 'pi-input-row';
-            piRow.id = `piRow${functionId}_${piId}`;
-            piRow.setAttribute('data-display-id', piDisplayId);
-            
-            piRow.innerHTML = `
-                <span class="pi-label">PI${piDisplayId}:</span>
-                <input type="text" class="pi-input" 
-                       placeholder="例如: 00-1, -110, 1-01" 
-                       oninput="updatePICount(${functionId})">
-                <button class="btn btn-remove" onclick="removePIFromFunction(${functionId}, ${piId})">✕</button>
-            `;
-            
-            functionPIInputs.appendChild(piRow);
-            updatePICount(functionId);
-        }
-        
-        // 從函數中移除 PI
-        function removePIFromFunction(functionId, piId) {
-            const piRow = document.getElementById(`piRow${functionId}_${piId}`);
-            if (piRow) {
-                piRow.remove();
-                // 重新整理該函數的 PI 編號
-                updatePINumbers(functionId);
-                updatePICount(functionId);
-            }
-        }
-        
-        // 重新整理指定函數的 PI 編號
-        function updatePINumbers(functionId) {
-            const functionPIInputs = document.getElementById(`functionPIInputs${functionId}`);
-            const piRows = functionPIInputs.querySelectorAll('.pi-input-row');
-            
-            piRows.forEach((row, index) => {
-                const displayId = index + 1;
-                row.setAttribute('data-display-id', displayId);
-                
-                // 更新 PI 標籤
-                const piLabel = row.querySelector('.pi-label');
-                if (piLabel) {
-                    piLabel.textContent = `PI${displayId}:`;
-                }
-            });
-        }
-        
-        // 更新 PI 數量顯示
-        function updatePICount(functionId) {
-            const functionPIInputs = document.getElementById(`functionPIInputs${functionId}`);
-            const piInputs = functionPIInputs.querySelectorAll('.pi-input');
-            const filledPIs = Array.from(piInputs).filter(input => input.value.trim() !== '').length;
-            const totalPIs = piInputs.length;
-            
-            const indicator = document.getElementById(`indicator${functionId}`);
-            if (indicator) {
-                indicator.textContent = `● PI 數量: ${filledPIs}/${totalPIs}`;
-                indicator.className = filledPIs > 0 ? 'function-pi-indicator active' : 'function-pi-indicator';
-            }
-        }
-        
-        // 初始化函數輸入框 (Minterm模式)
-        function initializeFunctionInputs() {
-            const functionInputs = document.getElementById('functionInputs');
-            functionInputs.innerHTML = '';
-            functionCounter = 1;
-            addFunctionInput(); // 添加第一個函數
-        }
-        
-        // 新增函數輸入 (Minterm模式)
-        function addFunctionInput() {
-            const functionInputs = document.getElementById('functionInputs');
-            
-            // 計算當前應該的函數編號（從1開始，連續編號）
-            const currentFunctionCount = functionInputs.children.length;
-            const functionDisplayId = currentFunctionCount + 1;
-            const functionId = functionCounter++;
-            
-            const functionRow = document.createElement('div');
-            functionRow.className = 'function-input-row';
-            functionRow.id = `functionRow${functionId}`;
-            functionRow.setAttribute('data-display-id', functionDisplayId);
-            
-            functionRow.innerHTML = `
-                <div class="function-header">
-                    <span class="function-label">函數 F${functionDisplayId}</span>
-                    <button class="btn btn-remove" onclick="removeFunctionInput(${functionId})">
-                        ✕ 移除函數
-                    </button>
-                </div>
-                <div class="function-inputs">
-                    <div style="width: 100%;">
-                        <span class="function-input-label">F${functionDisplayId} = Σm(</span>
-                        <input type="text" class="function-input" 
-                               placeholder="" 
-                               id="minterms${functionId}"
-                               style="width: 150px; display: inline-block; margin: 0 5px;">
-                        <span class="function-input-label">) + Σd(</span>
-                        <input type="text" class="function-input" 
-                               placeholder="" 
-                               id="dontcare${functionId}"
-                               style="width: 120px; display: inline-block; margin: 0 5px;">
-                        <span class="function-input-label">)</span>
-                    </div>
-                </div>
-            `;
-            
-            functionInputs.appendChild(functionRow);
-        }
-        
-        // 移除函數輸入 (Minterm模式)
-        function removeFunctionInput(functionId) {
-            const functionInputs = document.getElementById('functionInputs');
-            if (functionInputs.children.length <= 1) {
-                alert('至少需要保留一個函數！');
-                return;
-            }
-            
-            const functionRow = document.getElementById(`functionRow${functionId}`);
-            if (functionRow) {
-                functionRow.remove();
-                // 重新整理所有函數的編號
-                updateMintermFunctionNumbers();
-            }
-        }
-        
-        // 重新整理 Minterm 模式下所有函數的編號
-        function updateMintermFunctionNumbers() {
-            const functionInputs = document.getElementById('functionInputs');
-            const functionRows = functionInputs.querySelectorAll('.function-input-row');
-            
-            functionRows.forEach((row, index) => {
-                const displayId = index + 1;
-                row.setAttribute('data-display-id', displayId);
-                
-                // 更新函數標題
-                const functionLabel = row.querySelector('.function-label');
-                if (functionLabel) {
-                    functionLabel.textContent = `函數 F${displayId}`;
-                }
-                
-                // 更新函數表達式中的編號
-                const functionLabels = row.querySelectorAll('.function-input-label');
-                functionLabels.forEach(label => {
-                    if (label.textContent.includes('F') && label.textContent.includes('=')) {
-                        label.textContent = `F${displayId} = Σm(`;
-                    }
-                });
-            });
-        }
-        
-        // 清除所有輸入
-        function clearInputs() {
-            document.getElementById('variables').value = '';
-            
-            const currentMode = document.querySelector('input[name="inputMode"]:checked').value;
-            if (currentMode === 'pi') {
-                initializeMultiplePIInputs();
-            } else {
-                initializeFunctionInputs();
-            }
-        }
-        
-        // 執行多輸出最佳化
-        function runMultiOutputOptimization() {
-            const loadingArea = document.getElementById('loadingArea');
-            const resultArea = document.getElementById('resultArea');
-            
-            // 顯示載入動畫
-            loadingArea.classList.add('show');
-            resultArea.innerHTML = '';
-            
-            // 收集輸入資料
-            const variables = document.getElementById('variables').value.trim();
-            const inputMode = document.querySelector('input[name="inputMode"]:checked').value;
-            
-            if (!variables) {
-                setTimeout(() => {
-                    loadingArea.classList.remove('show');
-                    resultArea.innerHTML = `
-                        <div style="color: #dc3545; text-align: center; margin-top: 50px;">
-                            <h3>❌ 輸入錯誤</h3>
-                            <p>請先設定變數！</p>
-                        </div>
-                    `;
-                }, 1000);
-                return;
-            }
-            
-            let inputData = {};
-            let hasValidInput = false;
 
-            if (inputMode === 'pi') {
-                // 收集 PI 資料
-                inputData = collectPIData();
-                hasValidInput = Object.keys(inputData).length > 0;
-                
-                // 同時收集輸出函數定義（如果有的話）
-                const outputFunctionsValue = document.getElementById('outputFunctions').value.trim();
-                if (outputFunctionsValue) {
-                    inputData.outputFunctions = parseOutputFunctions(outputFunctionsValue);
-                }
-            } else {
-                // 收集 Minterm 資料
-                inputData = collectMintermData();
-                hasValidInput = Object.keys(inputData).length > 0;
-            }
-            
-            if (!hasValidInput) {
-                setTimeout(() => {
-                    loadingArea.classList.remove('show');
-                    resultArea.innerHTML = `
-                        <div style="color: #dc3545; text-align: center; margin-top: 50px;">
-                            <h3>❌ 輸入錯誤</h3>
-                            <p>請至少輸入一個函數的資料！</p>
-                        </div>
-                    `;
-                }, 1000);
-                return;
-            }
-            
-            // 執行真正的Patrick Method算法
-            setTimeout(() => {
-                try {
-                    executePatrickMethod(variables, inputData, inputMode);
-                } catch (error) {
-                    console.error('執行錯誤:', error);
-                    loadingArea.classList.remove('show');
-                    resultArea.innerHTML = `
-                        <div style="color: #dc3545; text-align: center; margin-top: 50px;">
-                            <h3>❌ 計算錯誤</h3>
-                            <p>${error.message}</p>
-                        </div>
-                    `;
-                }
-            }, 1000);
-        }
-        
-        /**
-         * 執行 Patrick Method 演算法主函數
-         * 處理輸入資料並調用核心演算法進行最佳化
-         * @param {string} variables - 變數字串
-         * @param {Object} inputData - 輸入資料物件
-         * @param {string} inputMode - 輸入模式（'pi' 或 'minterm'）
-         */
-        function executePatrickMethod(variables, inputData, inputMode) {
-            const loadingArea = document.getElementById('loadingArea');
-            const resultArea = document.getElementById('resultArea');
-            
-            try {
-                console.log('🚀 開始執行 Patrick Method');
-                console.log('變數:', variables);
-                console.log('輸入資料:', inputData);
-                console.log('輸入模式:', inputMode);
-                
-                // 解析變數字串為陣列
-                const variableList = variables.split(',').map(v => v.trim());
-                const numVars = variableList.length;
-                
-                let mintermsByFunction = {};
-                
-                if (inputMode === 'pi') {
-                    // PI 模式：需要使用輸出函數定義
-                    if (inputData.outputFunctions && Object.keys(inputData.outputFunctions).length > 0) {
-                        // 使用輸出函數定義中的 minterms
-                        Object.entries(inputData.outputFunctions).forEach(([funcName, funcData]) => {
-                            mintermsByFunction[funcName] = funcData.minterms || [];
-                        });
-                    } else {
-                        // 如果沒有輸出函數定義，從 PI 計算 minterms
-                        Object.entries(inputData).forEach(([funcName, pis]) => {
-                            if (funcName !== 'outputFunctions' && Array.isArray(pis)) {
-                                const minterms = new Set();
-                                pis.forEach(pi => {
-                                    const piValue = pi.trim();
-                                    if (piValue) {
-                                        const coveredMinterms = calculateMintermsFromPI(piValue, numVars);
-                                        coveredMinterms.forEach(m => minterms.add(m));
-                                    }
-                                });
-                                mintermsByFunction[funcName] = Array.from(minterms).sort((a, b) => a - b);
-                            }
-                        });
-                    }
-                } else {
-                    // Minterm模式：收集minterms和don't care項
-                    const allDontCares = new Set();
-                    
-                    Object.entries(inputData).forEach(([funcName, funcData]) => {
-                        mintermsByFunction[funcName] = funcData.minterms || [];
-                        
-                        // 收集don't care項
-                        if (funcData.dontcare && funcData.dontcare.length > 0) {
-                            const dontcares = funcData.dontcare.map(m => 
-                                typeof m === 'string' ? parseInt(m.trim()) : m
-                            ).filter(m => !isNaN(m));
-                            dontcares.forEach(dc => allDontCares.add(dc));
-                        }
-                    });
-                    
-                    // 將所有don't care項傳遞給算法
-                    var dontCares = Array.from(allDontCares);
-                }
-                
-                console.log('處理後的minterms:', mintermsByFunction);
-                
-                // 檢查是否有有效的函數資料
-                const validFunctions = Object.keys(mintermsByFunction).filter(
-                    funcName => mintermsByFunction[funcName].length > 0
-                );
-                
-                if (validFunctions.length === 0) {
-                    throw new Error('沒有找到有效的函數資料！請檢查輸入。');
-                }
-                
-                // 創建MultipleOutputPatrick實例
-                const multiPatrick = new MultipleOutputPatrick();
-                
-                // 設定變數
-                multiPatrick.variables = variableList;
-                
-                // 執行多輸出最佳化
-                console.log('執行多輸出最佳化...');
-                const results = multiPatrick.executeMultipleOutput(mintermsByFunction, numVars, dontCares || []);
-                
-                console.log('最佳化結果:', results);
-                
-                // 顯示結果
-                loadingArea.classList.remove('show');
-                displayPatrickMethodResults(results, variableList);
-                
-            } catch (error) {
-                console.error('Patrick Method執行錯誤:', error);
-                loadingArea.classList.remove('show');
-                resultArea.innerHTML = `
-                    <div style="color: #dc3545; text-align: center; margin-top: 50px;">
-                        <h3>❌ 計算錯誤</h3>
-                        <p>${error.message}</p>
-                        <details style="margin-top: 15px; text-align: left;">
-                            <summary>錯誤詳情</summary>
-                            <pre style="margin-top: 10px; padding: 10px; background: #f8f9fa; border-radius: 4px; font-size: 12px;">${error.stack}</pre>
-                        </details>
-                    </div>
-                `;
-            }
-        }
-        
-        /**
-         * 計算單個系統解決方案的成本
-         * 包括個別成本、共享成本和節省成本的計算
-         * @param {Object} systemSolution - 系統解決方案物件
-         * @returns {Object} 包含各種成本資訊的物件
-         */
-        function calculateSolutionCosts(systemSolution) {
-            // 計算個別成本總和（不考慮共享）
-            let totalIndividualCost = 0;
-            Object.values(systemSolution).forEach(solution => {
-                totalIndividualCost += solution.cost;
-            });
+        <fieldset class="mode-switch">
+          <legend>輸入模式</legend>
+          <label>
+            <input type="radio" name="mode" value="minterms" checked />
+            <span>Minterms</span>
+          </label>
+          <label>
+            <input type="radio" name="mode" value="primes" />
+            <span>Prime Implicants</span>
+          </label>
+        </fieldset>
+
+        <div class="examples" aria-label="範例">
+          <span>快速範例</span>
+          <button type="button" class="example-button" data-example="single">單輸出</button>
+          <button type="button" class="example-button" data-example="shared">共享項</button>
+          <button type="button" class="example-button" data-example="dont-care">Don't-care</button>
+        </div>
 
-            // 統計 Prime Implicants 使用次數
-            const piUsageCount = new Map();
-            Object.values(systemSolution).forEach(solution => {
-                solution.pis.forEach(pi => {
-                    const count = piUsageCount.get(pi.pattern) || 0;
-                    piUsageCount.set(pi.pattern, count + 1);
-                });
-            });
+        <div id="function-list" class="function-list"></div>
+
+        <div class="input-actions">
+          <button id="add-function" class="button button-secondary" type="button">
+            ＋ 新增輸出
+          </button>
+          <button id="solve-button" class="button button-primary" type="button">
+            <span>執行 Exact Minimization</span>
+            <span aria-hidden="true">→</span>
+          </button>
+          <button id="cancel-button" class="button button-secondary" type="button" hidden>
+            取消求解
+          </button>
+        </div>
 
-            // 計算重複 PI 的成本節省
-            let duplicatedPICost = 0;
-            piUsageCount.forEach((count, pattern) => {
-                if (count > 1) {
-                    // 從任一使用此 PI 的函數中獲取 PI 成本
-                    const piCost = Object.values(systemSolution)
-                        .flatMap(sol => sol.pis)
-                        .find(pi => pi.pattern === pattern)?.cost || 0;
-                    duplicatedPICost += (count - 1) * piCost;
-                    console.log(`PI ${pattern} 使用 ${count} 次，成本 ${piCost}，節省成本: ${(count-1) * piCost}`);
-                }
-            });
-            console.log(`總重複 PI 成本: ${duplicatedPICost}`);
+        <div id="validation-summary" class="validation-summary" role="alert" hidden></div>
+      </section>
+
+      <section class="panel result-panel" aria-labelledby="result-title">
+        <div class="section-heading">
+          <div>
+            <p class="section-index">02 / VERIFY</p>
+            <h2 id="result-title">求解結果</h2>
+          </div>
+          <button id="copy-button" class="button button-ghost" type="button" disabled>複製</button>
+        </div>
+
+        <div id="result-region" class="result-region" aria-live="polite">
+          <div class="empty-state">
+            <div class="logic-mark" aria-hidden="true">Σ</div>
+            <h3>等待函數定義</h3>
+            <p>載入範例，或輸入 minterms 後執行求解。</p>
+          </div>
+        </div>
+      </section>
+    </main>
 
-            const sharedCost = totalIndividualCost - duplicatedPICost;
-            const savings = totalIndividualCost - sharedCost;
+    <section class="evidence-strip" aria-label="工程證據">
+      <div>
+        <span class="evidence-value">256</span>
+        <span class="evidence-label">三變數 truth tables</span>
+      </div>
+      <div>
+        <span class="evidence-value">Local</span>
+        <span class="evidence-label">資料不離開瀏覽器</span>
+      </div>
+      <div>
+        <span class="evidence-value">Fail fast</span>
+        <span class="evidence-label">邊界與複雜度限制</span>
+      </div>
+    </section>
 
-            return {
-                totalIndividualCost,
-                sharedCost,
-                savings
-            };
-        }
+    <footer>
+      <p>
+        適合教學與小型邏輯驗證，不取代工業 EDA／logic synthesis。
+        <a href="https://github.com/Bigsticktw/boolean-function-minimizer">View source</a>
+      </p>
+    </footer>
 
-        /**
-         * 顯示 Patrick Method 演算法結果
-         * 格式化並展示最佳化結果，包括解決方案和成本分析
-         * @param {Object} results - 演算法執行結果
-         * @param {Array} variables - 變數陣列
-         */
-        function displayPatrickMethodResults(results, variables) {
-            const resultArea = document.getElementById('resultArea');
-            resultArea.classList.add('has-content');
-            
-            if (!results.success) {
-                resultArea.innerHTML = `<div style="color: #dc3545;">❌ 計算失敗<br>${results.error || '未知錯誤'}</div>`;
-                return;
-            }
-            
-            let resultText = '';
-            
-            // 判斷是單函數還是多函數模式
-            let isSingleFunction = false;
-            if (results.solutions) {
-                isSingleFunction = Object.keys(results.solutions).length === 1;
-            } else if (results.systemSolutions && results.systemSolutions.length > 0) {
-                isSingleFunction = Object.keys(results.systemSolutions[0]).length === 1;
-            } else if (results.allFormattedSolutions && results.allFormattedSolutions.length > 0) {
-                // 檢查第一個格式化解決方案的函數數量
-                const firstSolution = results.allFormattedSolutions[0];
-                if (firstSolution.expressions) {
-                    isSingleFunction = firstSolution.expressions.length === 1;
-                }
-            }
-            
-            // 優先使用新的統一格式化顯示
-            console.log('🔍 檢查格式化解決方案:', results.allFormattedSolutions);
-            if (results.allFormattedSolutions && results.allFormattedSolutions.length > 0) {
-                console.log('✅ 使用新的統一格式化顯示');
-                resultText += `📊 最佳化結果\n`;
-                resultText += `🎯 多輸出最佳化結果\n`;
-                resultText += `變數: ${variables.join(', ')}\n\n`;
-                
-                if (results.allFormattedSolutions.length > 1) {
-                    resultText += `🎯 找到 ${results.allFormattedSolutions.length} 個相同成本的最佳解決方案\n\n`;
-                    
-                    results.allFormattedSolutions.forEach((formattedSolution, index) => {
-                        resultText += `🔹 解決方案 ${index + 1}:\n`;
-                        if (formattedSolution.expressions) {
-                            formattedSolution.expressions.forEach(expression => {
-                                resultText += `${expression}\n`;
-                            });
-                        }
-                        if (formattedSolution.usedPIPatterns) {
-                            resultText += `使用的PI: ${formattedSolution.usedPIPatterns.join(', ')}\n`;
-                        }
-                        if (formattedSolution.sharedCost !== undefined) {
-                            resultText += `共享成本: ${formattedSolution.sharedCost} 個閘級\n`;
-                        }
-                        resultText += '\n';
-                    });
-                } else {
-                    // 單一解決方案
-                    const formattedSolution = results.allFormattedSolutions[0];
-                    resultText += `🔹 解決方案:\n`;
-                    if (formattedSolution.expressions) {
-                        formattedSolution.expressions.forEach(expression => {
-                            resultText += `${expression}\n`;
-                        });
-                    }
-                    if (formattedSolution.usedPIPatterns) {
-                        resultText += `使用的PI: ${formattedSolution.usedPIPatterns.join(', ')}\n`;
-                    }
-                    if (formattedSolution.sharedCost !== undefined) {
-                        resultText += `共享成本: ${formattedSolution.sharedCost} 個閘級\n`;
-                    }
-                    resultText += '\n';
-                }
-                
-                // 成本分析
-                if (results.totalIndividualCost && results.sharedOptimizedCost) {
-                    resultText += `💰 成本分析\n`;
-                    if (isSingleFunction) {
-                        resultText += `成本計算方式：1個literal成本=1，多個literals成本=literal數量+1\n`;
-                        resultText += `例如：y 有 1 個符號，成本為 1；x'z' 有 2 個符號，成本為 2 + 1 = 3\n\n`;
-                    } else {
-                        resultText += `成本計算方式：每個項的成本 = 符號數量 + 1\n`;
-                        resultText += `例如：x'z' 有 2 個符號，成本為 2 + 1 = 3\n\n`;
-                    }
-                    resultText += `個別最佳化總成本: ${results.totalIndividualCost}\n`;
-                    resultText += `共享最佳化總成本: ${results.sharedOptimizedCost}\n`;
-                    
-                    if (results.savings > 0) {
-                        resultText += `💡 節省成本: ${results.savings} (${((results.savings / results.totalIndividualCost) * 100).toFixed(1)}%)\n`;
-                    }
-                    resultText += '\n';
-                }
-                
-                // 計算步驟詳解
-                if (results.calculationSteps && results.calculationSteps.length > 0) {
-                    resultText += `🔍 計算步驟詳解\n\n`;
-                    results.calculationSteps.forEach(step => {
-                        resultText += `步驟 ${step.step}: ${step.title}\n`;
-                        resultText += `${step.description}\n`;
-                        resultText += `${step.details.join('\n')}\n\n`;
-                    });
-                }
-                
-            } else {
-                // 回退到傳統顯示方式
-                console.log('⚠️ 未找到格式化解決方案，使用傳統顯示方式');
-                console.log('results.allFormattedSolutions:', results.allFormattedSolutions);
-                console.log('results.formattedSolution:', results.formattedSolution);
-                
-                // 主要結果標題
-                resultText += `🎯 多輸出最佳化結果\n`;
-                resultText += `變數: ${variables.join(', ')}\n\n`;
-                
-                // 系統解顯示
-                if (results.systemSolutions && results.systemSolutions.length > 1) {
-                resultText += `🎯 找到 ${results.systemSolutions.length} 個相同成本的最佳解決方案\n\n`;
-                
-                results.systemSolutions.forEach((systemSolution, index) => {
-                    resultText += `🔹 解決方案 ${index + 1}:\n`;
-                    
-                    // 按照F1, F2, F3...的順序排序
-                    const sortedEntries = Object.entries(systemSolution).sort(([a], [b]) => {
-                        const numA = parseInt(a.replace('F', ''));
-                        const numB = parseInt(b.replace('F', ''));
-                        return numA - numB;
-                    });
-                    
-                    // 顯示函數表達式
-                    sortedEntries.forEach(([funcName, solution]) => {
-                        resultText += `  ${funcName} = ${solution.expression}\n`;
-                    });
-                    
-                    // 收集使用的PI並計算成本
-                    const usedPIs = [];
-                    sortedEntries.forEach(([funcName, solution]) => {
-                        solution.pis.forEach(pi => {
-                            if (!usedPIs.find(p => p.pattern === pi.pattern)) {
-                                usedPIs.push(pi);
-                            }
-                        });
-                    });
-                    
-                    resultText += `  使用的PI: ${usedPIs.map(pi => pi.pattern).join(', ')}\n`;
-                    resultText += `  成本: ${usedPIs.reduce((sum, pi) => sum + pi.cost, 0)} 個閘級\n\n`;
-                });
-                
-                // 添加成本統計
-                resultText += `💰 多重解成本分析\n`;
-                const firstSolution = results.systemSolutions[0];
-                const solutionCosts = calculateSolutionCosts(firstSolution);
-                
-                resultText += `所有解決方案成本相同: ${solutionCosts.sharedCost}\n`;
-                if (solutionCosts.savings > 0) {
-                    resultText += `相比個別最佳化節省: ${solutionCosts.savings} (${((solutionCosts.savings / solutionCosts.totalIndividualCost) * 100).toFixed(1)}%)\n`;
-                }
-                resultText += '\n';
-                
-            } else if (results.systemSolutions && results.systemSolutions.length === 1) {
-                // 單一系統解
-                resultText += `🎯 唯一最佳解決方案\n\n`;
-                
-                const systemSolution = results.systemSolutions[0];
-                const sortedEntries = Object.entries(systemSolution).sort(([a], [b]) => {
-                    const numA = parseInt(a.replace('F', ''));
-                    const numB = parseInt(b.replace('F', ''));
-                    return numA - numB;
-                });
-                
-                sortedEntries.forEach(([funcName, solution]) => {
-                    resultText += `${funcName} = ${solution.expression}\n`;
-                });
-                
-                const usedPIs = [];
-                sortedEntries.forEach(([funcName, solution]) => {
-                    solution.pis.forEach(pi => {
-                        if (!usedPIs.find(p => p.pattern === pi.pattern)) {
-                            usedPIs.push(pi);
-                        }
-                    });
-                });
-                
-                resultText += `使用的PI: ${usedPIs.map(pi => pi.pattern).join(', ')}\n`;
-                resultText += `成本: ${usedPIs.reduce((sum, pi) => sum + pi.cost, 0)} 個閘級\n\n`;
-                
-            } else if (results.allSolutions && results.allSolutions.length > 1) {
-                // 檢查是單函數還是多函數的多解
-                const firstSolution = results.allSolutions[0];
-                const isMultiFunction = firstSolution && firstSolution.functions && Object.keys(firstSolution.functions).length > 1;
-                
-                if (isMultiFunction) {
-                    // 多函數多解顯示
-                    resultText += `🎯 找到 ${results.allSolutions.length} 個相同成本的最佳解決方案\n\n`;
-                    
-                    results.allSolutions.forEach((solution) => {
-                        resultText += `🔹 解決方案 ${solution.solutionNumber}:\n`;
-                        
-                        // 安全檢查 solution.functions
-                        if (solution.functions && typeof solution.functions === 'object') {
-                            // 按照F1, F2, F3...的順序顯示函數
-                            const sortedFunctions = Object.entries(solution.functions).sort(([a], [b]) => {
-                                const numA = parseInt(a.replace('F', ''));
-                                const numB = parseInt(b.replace('F', ''));
-                                return numA - numB;
-                            });
-                            
-                            sortedFunctions.forEach(([funcName, funcData]) => {
-                                resultText += `  ${funcName} = ${funcData.expression}\n`;
-                            });
-                        }
-                        
-                        if (solution.usedPIPatterns) {
-                            resultText += `  使用的PI: ${solution.usedPIPatterns.join(', ')}\n`;
-                        }
-                        if (solution.sharedCost !== undefined) {
-                            resultText += `  共享成本: ${solution.sharedCost} 個閘級\n`;
-                        }
-                        resultText += `\n`;
-                    });
-                } else {
-                    // 單函數多解顯示
-                    resultText += `🎯 找到 ${results.allSolutions.length} 個相同成本的最佳解決方案\n\n`;
-                    
-                    results.allSolutions.forEach((solution, index) => {
-                        resultText += `解決方案 ${index + 1}: ${results.functionName || 'F1'} = ${solution.expression}\n`;
-                        if (solution.pis) {
-                            resultText += `使用的PI: ${solution.pis.map(pi => pi.pattern).join(', ')} | 成本: ${solution.cost} 個閘級\n\n`;
-                        }
-                    });
-                }
-                
-            } else if (Object.keys(results.solutions || {}).length === 1 && results.allSolutions && results.allSolutions.length > 1) {
-                // 單函數多解顯示
-                resultText += `🎯 找到 ${results.allSolutions.length} 個相同成本的最佳解決方案\n\n`;
-                
-                results.allSolutions.forEach((solution, index) => {
-                    resultText += `解決方案 ${index + 1}: ${results.functionName} = ${solution.expression}\n`;
-                    resultText += `使用的PI: ${solution.pis.map(pi => pi.pattern).join(', ')} | 成本: ${solution.cost} 個閘級\n\n`;
-                });
-                
-            } else {
-                // 傳統顯示方式
-                resultText += `📊 各函數最佳化結果\n`;
-                if (results.solutions && typeof results.solutions === 'object') {
-                    Object.entries(results.solutions).forEach(([funcName, solution]) => {
-                        if (solution && typeof solution === 'object') {
-                            resultText += `${funcName}: ${funcName} = ${solution.expression || '無表達式'}\n`;
-                            if (solution.pis && Array.isArray(solution.pis)) {
-                                resultText += `使用的PI: ${solution.pis.map(pi => pi.pattern || pi).join(', ')} | 成本: ${solution.cost || 0}\n\n`;
-                            } else {
-                                resultText += `成本: ${solution.cost || 0}\n\n`;
-                            }
-                        }
-                    });
-                } else {
-                    resultText += `無解決方案數據\n\n`;
-                }
-            }
-            
-            // 共享Prime Implicants
-            if (results.sharedPIs && results.sharedPIs.length > 0) {
-                resultText += `🔄 共享Prime Implicants\n`;
-                results.sharedPIs.forEach(sharedPI => {
-                    const algebraic = convertPatternToAlgebraicDisplay(sharedPI.pattern, variables);
-                    resultText += `${sharedPI.pattern} → ${algebraic} (用於: ${sharedPI.usedBy.join(', ')}, 成本: ${sharedPI.cost})\n`;
-                });
-                resultText += '\n';
-            }
-            
-            // 成本分析
-            resultText += `💰 成本分析\n`;
-            if (isSingleFunction) {
-                resultText += `成本計算方式：1個literal成本=1，多個literals成本=literal數量+1\n`;
-                resultText += `例如：y 有 1 個符號，成本為 1；x'z' 有 2 個符號，成本為 2 + 1 = 3\n\n`;
-            } else {
-                resultText += `成本計算方式：每個項的成本 = 符號數量 + 1\n`;
-                resultText += `例如：x'z' 有 2 個符號，成本為 2 + 1 = 3\n\n`;
-            }
-            resultText += `個別最佳化總成本: ${results.totalIndividualCost}\n`;
-            resultText += `共享最佳化總成本: ${results.sharedOptimizedCost}\n`;
-            
-            if (results.savings > 0) {
-                resultText += `💡 節省成本: ${results.savings} (${((results.savings / results.totalIndividualCost) * 100).toFixed(1)}%)\n`;
-            }
-            resultText += '\n';
-            
-            // 計算步驟詳解
-            if (results.calculationSteps && results.calculationSteps.length > 0) {
-                resultText += `🔍 計算步驟詳解\n\n`;
-                results.calculationSteps.forEach(step => {
-                    resultText += `步驟 ${step.step}: ${step.title}\n`;
-                    resultText += `${step.description}\n`;
-                    resultText += `${step.details.join('\n')}\n\n`;
-                });
-            }
-            
-            }
-            
-            // 將純文字轉換為HTML，保留換行
-            const resultHTML = resultText.replace(/\n/g, '<br>');
-            resultArea.innerHTML = `<div style="font-family: 'Courier New', monospace; line-height: 1.5; white-space: pre-wrap;">${resultHTML}</div>`;
-        }
-        
-        // 輔助函數：將pattern轉換為代數表達式顯示
-        function convertPatternToAlgebraicDisplay(pattern, variables) {
-            let algebraic = '';
-            
-            for (let i = 0; i < pattern.length; i++) {
-                if (pattern[i] === '1') {
-                    algebraic += variables[i] || `X${i}`;
-                } else if (pattern[i] === '0') {
-                    algebraic += (variables[i] || `X${i}`) + "'";
-                }
-            }
-            
-            return algebraic || '1';
-        }
-        
-        // 收集 PI 資料
-        function collectPIData() {
-            const data = {};
-            const multiplePIInputs = document.getElementById('multiplePIInputs');
-            const functionGroups = multiplePIInputs.querySelectorAll('.function-pi-group');
-            
-            functionGroups.forEach((group, index) => {
-                const displayId = group.getAttribute('data-display-id') || (index + 1);
-                const functionId = group.id.replace('functionPIGroup', '');
-                const functionPIInputs = document.getElementById(`functionPIInputs${functionId}`);
-                const piInputs = functionPIInputs.querySelectorAll('.pi-input');
-                const pis = Array.from(piInputs)
-                    .map(input => input.value.trim())
-                    .filter(value => value !== '');
-                
-                if (pis.length > 0) {
-                    data[`F${displayId}`] = pis;
-                }
-            });
-            
-            return data;
-        }
-        
-        // 收集 Minterm 資料
-        function collectMintermData() {
-            const data = {};
-            
-            const functionInputs = document.getElementById('functionInputs');
-            const functionRows = functionInputs.querySelectorAll('.function-input-row');
-            
-            functionRows.forEach((row, index) => {
-                const displayId = row.getAttribute('data-display-id') || (index + 1);
-                const functionId = row.id.replace('functionRow', '');
-                const mintermsInput = document.getElementById(`minterms${functionId}`);
-                const dontcareInput = document.getElementById(`dontcare${functionId}`);
-                
-                const minterms = mintermsInput ? mintermsInput.value.trim() : '';
-                const dontcare = dontcareInput ? dontcareInput.value.trim() : '';
-                
-                if (minterms) {
-                    data[`F${displayId}`] = {
-                        minterms: minterms.split(',').map(m => m.trim()).filter(m => m),
-                        dontcare: dontcare ? dontcare.split(',').map(m => m.trim()).filter(m => m) : []
-                    };
-                }
-            });
-            
-            return data;
-        }
-        
-        // 自動生成函數定義 (PI 模式)
-        function generateFunctionDefinitions() {
-            const variables = document.getElementById('variables').value.trim();
-            
-            if (!variables) {
-                alert('請先設定變數！');
-                return;
-            }
-            
-            const variableList = variables.split(',').map(v => v.trim());
-            const numVars = variableList.length;
-            
-            if (numVars === 0) {
-                alert('請輸入有效的變數！');
-                return;
-            }
-            
-            // 收集 PI 資料
-            const piData = collectPIData();
-            
-            if (Object.keys(piData).length === 0) {
-                alert('請先輸入 Prime Implicants！');
-                return;
-            }
-            
-            let functionDefinitions = [];
-            
-            // 為每個函數計算 minterms
-            Object.keys(piData).forEach(functionName => {
-                const pis = piData[functionName];
-                const minterms = new Set();
-                
-                pis.forEach(pi => {
-                    const piValue = pi.trim();
-                    if (piValue) {
-                        // 計算這個 PI 覆蓋的所有 minterms
-                        const coveredMinterms = calculateMintermsFromPI(piValue, numVars);
-                        coveredMinterms.forEach(m => minterms.add(m));
-                    }
-                });
-                
-                // 轉換為排序後的陣列
-                const sortedMinterms = Array.from(minterms).sort((a, b) => a - b);
-                
-                if (sortedMinterms.length > 0) {
-                    functionDefinitions.push(`${functionName}: ${sortedMinterms.join(',')}`);
-                }
-            });
-            
-            // 將生成的函數定義填入文本域
-            const outputFunctionsTextarea = document.getElementById('outputFunctions');
-            if (outputFunctionsTextarea) {
-                outputFunctionsTextarea.value = functionDefinitions.join('\n');
-                
-                // 顯示成功訊息
-                alert(`✅ 已自動生成 ${functionDefinitions.length} 個函數的定義！\n\n請檢查並確認輸出函數定義區域的內容。`);
-                
-                // 讓文本域獲得焦點並滾動到該位置
-                outputFunctionsTextarea.focus();
-                outputFunctionsTextarea.scrollIntoView({ behavior: 'smooth', block: 'center' });
-            }
-        }
-        
-        // 解析輸出函數定義
-        function parseOutputFunctions(outputFunctionsText) {
-            const outputFunctions = {};
-            const lines = outputFunctionsText.split('\n').filter(line => line.trim());
-            
-            lines.forEach(line => {
-                const trimmedLine = line.trim();
-                if (trimmedLine.includes(':')) {
-                    const [functionPart, mintermsPart] = trimmedLine.split(':').map(part => part.trim());
-                    
-                    // 提取函數名稱（移除可能的 'F' 前綴）
-                    let functionName = functionPart;
-                    if (functionName.match(/^F\d+$/)) {
-                        // 保持 F1, F2 格式
-                    } else if (functionName.match(/^\d+$/)) {
-                        // 如果只是數字，加上 F 前綴
-                        functionName = 'F' + functionName;
-                    }
-                    
-                    // 解析 minterms（支援多種格式）
-                    let minterms = [];
-                    if (mintermsPart) {
-                        // 移除可能的 'm' 前綴和空格
-                        const cleanMinterms = mintermsPart.replace(/m/g, '').replace(/\s/g, '');
-                        minterms = cleanMinterms.split(',')
-                            .map(term => term.trim())
-                            .filter(term => term && !isNaN(term))
-                            .map(term => parseInt(term));
-                    }
-                    
-                    if (minterms.length > 0) {
-                        outputFunctions[functionName] = {
-                            minterms: minterms.sort((a, b) => a - b),
-                            dontcare: [] // 預設沒有 don't care
-                        };
-                    }
-                }
-            });
-            
-            return outputFunctions;
-        }
-        
-        // 從 PI 計算覆蓋的 minterms
-        function calculateMintermsFromPI(pi, numVars) {
-            const minterms = [];
-            
-            // 移除空格並驗證長度
-            pi = pi.replace(/\s/g, '');
-            if (pi.length !== numVars) {
-                console.warn(`PI "${pi}" 長度不符合變數數量 ${numVars}`);
-                return minterms;
-            }
-            
-            // 計算所有可能的組合
-            const dontCarePositions = [];
-            const fixedBits = [];
-            
-            for (let i = 0; i < pi.length; i++) {
-                if (pi[i] === '-') {
-                    dontCarePositions.push(i);
-                    fixedBits.push(0); // 暫時設為0
-                } else if (pi[i] === '0' || pi[i] === '1') {
-                    fixedBits.push(parseInt(pi[i]));
-                } else {
-                    console.warn(`PI "${pi}" 包含無效字符 "${pi[i]}"`);
-                    return minterms;
-                }
-            }
-            
-            // 生成所有可能的組合
-            const numCombinations = Math.pow(2, dontCarePositions.length);
-            
-            for (let combo = 0; combo < numCombinations; combo++) {
-                const currentBits = [...fixedBits];
-                
-                // 設置 don't care 位置的值
-                for (let i = 0; i < dontCarePositions.length; i++) {
-                    const pos = dontCarePositions[i];
-                    const bit = (combo >> i) & 1;
-                    currentBits[pos] = bit;
-                }
-                
-                // 計算 minterm 值
-                let mintermValue = 0;
-                for (let i = 0; i < currentBits.length; i++) {
-                    mintermValue += currentBits[i] * Math.pow(2, numVars - 1 - i);
-                }
-                
-                minterms.push(mintermValue);
-            }
-            
-            return minterms.sort((a, b) => a - b);
-        }
-        
-        // URL 參數處理和分享功能
-        function initializeFromURL() {
-            const urlParams = new URLSearchParams(window.location.search);
-            
-            // 處理模式切換
-            const mode = urlParams.get('mode');
-            if (mode === 'pi' || mode === 'minterm') {
-                updateInputMode(mode);
-            } else {
-                updateInputMode('pi'); // 默認為 PI 模式
-            }
-            
-            // 處理分享的內容
-            const sharedTitle = urlParams.get('title');
-            const sharedText = urlParams.get('text');
-            const sharedUrl = urlParams.get('url');
-            
-            if (sharedText) {
-                // 嘗試解析分享的文本作為函數定義
-                try {
-                    const outputFunctionsTextarea = document.getElementById('outputFunctions');
-                    if (outputFunctionsTextarea && sharedText.includes(':')) {
-                        outputFunctionsTextarea.value = sharedText;
-                        alert('已載入分享的函數定義！');
-                    }
-                } catch (error) {
-                    console.log('無法解析分享的內容:', error);
-                }
-            }
-        }
-        
-        // 分享當前結果
-        function shareResults() {
-            if (!navigator.share) {
-                // 降級到複製到剪貼板
-                copyResultsToClipboard();
-                return;
-            }
-            
-            const resultArea = document.getElementById('resultArea');
-            if (!resultArea || !resultArea.innerHTML.trim() || resultArea.innerHTML.includes('等待輸入')) {
-                alert('請先執行 Patrick Method 以獲得結果！');
-                return;
-            }
-            
-            // 收集當前的函數定義
-            let shareText = '';
-            const outputFunctionsTextarea = document.getElementById('outputFunctions');
-            if (outputFunctionsTextarea && outputFunctionsTextarea.value.trim()) {
-                shareText = outputFunctionsTextarea.value.trim();
-            }
-            
-            // 如果沒有函數定義，嘗試從結果中提取
-            if (!shareText) {
-                const resultText = resultArea.textContent || resultArea.innerText;
-                const lines = resultText.split('\n').filter(line => line.trim());
-                shareText = lines.slice(0, 10).join('\n'); // 取前10行
-            }
-            
-            navigator.share({
-                title: '布林函數最小化結果',
-                text: shareText,
-                url: window.location.href
-            }).catch(error => {
-                console.log('分享失敗:', error);
-                copyResultsToClipboard();
-            });
-        }
-        
-        // 複製結果到剪貼板（降級方案）
-        function copyResultsToClipboard() {
-            const resultArea = document.getElementById('resultArea');
-            if (!resultArea || !resultArea.innerHTML.trim() || resultArea.innerHTML.includes('等待輸入')) {
-                alert('請先執行 Patrick Method 以獲得結果！');
-                return;
-            }
-            
-            const resultText = resultArea.textContent || resultArea.innerText;
-            
-            if (navigator.clipboard) {
-                navigator.clipboard.writeText(resultText).then(() => {
-                    alert('結果已複製到剪貼板！');
-                }).catch(error => {
-                    console.log('複製失敗:', error);
-                    fallbackCopyToClipboard(resultText);
-                });
-            } else {
-                fallbackCopyToClipboard(resultText);
-            }
-        }
-        
-        // 降級複製方案
-        function fallbackCopyToClipboard(text) {
-            const textArea = document.createElement('textarea');
-            textArea.value = text;
-            textArea.style.position = 'fixed';
-            textArea.style.left = '-999999px';
-            textArea.style.top = '-999999px';
-            document.body.appendChild(textArea);
-            textArea.focus();
-            textArea.select();
-            
-            try {
-                document.execCommand('copy');
-                alert('結果已複製到剪貼板！');
-            } catch (error) {
-                console.log('複製失敗:', error);
-                alert('無法複製到剪貼板，請手動選擇並複製結果。');
-            }
-            
-            document.body.removeChild(textArea);
-        }
-        
-        // 處理檔案拖放和開啟
-        function setupFileHandling() {
-            const dropZone = document.body;
-            
-            // 防止預設的拖放行為
-            ['dragenter', 'dragover', 'dragleave', 'drop'].forEach(eventName => {
-                dropZone.addEventListener(eventName, preventDefaults, false);
-            });
-            
-            function preventDefaults(e) {
-                e.preventDefault();
-                e.stopPropagation();
-            }
-            
-            // 處理檔案拖放
-            dropZone.addEventListener('drop', handleDrop, false);
-            
-            function handleDrop(e) {
-                const dt = e.dataTransfer;
-                const files = dt.files;
-                
-                if (files.length > 0) {
-                    handleFiles(files);
-                }
-            }
-            
-            function handleFiles(files) {
-                Array.from(files).forEach(file => {
-                    if (file.type === 'text/plain' || file.type === 'application/json' || file.name.endsWith('.txt')) {
-                        const reader = new FileReader();
-                        reader.onload = function(e) {
-                            const content = e.target.result;
-                            loadContentFromFile(content);
-                        };
-                        reader.readAsText(file);
-                    }
-                });
-            }
-            
-            function loadContentFromFile(content) {
-                try {
-                    // 嘗試載入為函數定義
-                    const outputFunctionsTextarea = document.getElementById('outputFunctions');
-                    if (outputFunctionsTextarea) {
-                        outputFunctionsTextarea.value = content;
-                        alert('已載入檔案內容！');
-                    }
-                } catch (error) {
-                    console.log('載入檔案失敗:', error);
-                    alert('無法載入檔案內容。');
-                }
-            }
-        }
-        
-        // 初始化界面
-        initializeFromURL();
-        setupFileHandling();
-    </script>
-</body>
-</html> 
\ No newline at end of file
+    <noscript>此工具需要 JavaScript 才能在本機執行布林函數最小化。</noscript>
+    <script type="module" src="/src/main.ts"></script>
+  </body>
+</html>
diff --git a/ios/100.png b/ios/100.png
deleted file mode 100644
index 0e513d4..0000000
Binary files a/ios/100.png and /dev/null differ
diff --git a/ios/1024.png b/ios/1024.png
deleted file mode 100644
index 1b42269..0000000
Binary files a/ios/1024.png and /dev/null differ
diff --git a/ios/114.png b/ios/114.png
deleted file mode 100644
index 4c38244..0000000
Binary files a/ios/114.png and /dev/null differ
diff --git a/ios/120.png b/ios/120.png
deleted file mode 100644
index ad6693a..0000000
Binary files a/ios/120.png and /dev/null differ
diff --git a/ios/128.png b/ios/128.png
deleted file mode 100644
index b3c0208..0000000
Binary files a/ios/128.png and /dev/null differ
diff --git a/ios/144.png b/ios/144.png
deleted file mode 100644
index 65426d2..0000000
Binary files a/ios/144.png and /dev/null differ
diff --git a/ios/152.png b/ios/152.png
deleted file mode 100644
index a8dfcce..0000000
Binary files a/ios/152.png and /dev/null differ
diff --git a/ios/16.png b/ios/16.png
deleted file mode 100644
index 9756380..0000000
Binary files a/ios/16.png and /dev/null differ
diff --git a/ios/167.png b/ios/167.png
deleted file mode 100644
index e590d3a..0000000
Binary files a/ios/167.png and /dev/null differ
diff --git a/ios/180.png b/ios/180.png
deleted file mode 100644
index 81cd36d..0000000
Binary files a/ios/180.png and /dev/null differ
diff --git a/ios/192.png b/ios/192.png
deleted file mode 100644
index 0faa67f..0000000
Binary files a/ios/192.png and /dev/null differ
diff --git a/ios/20.png b/ios/20.png
deleted file mode 100644
index 253ce01..0000000
Binary files a/ios/20.png and /dev/null differ
diff --git a/ios/256.png b/ios/256.png
deleted file mode 100644
index 133097a..0000000
Binary files a/ios/256.png and /dev/null differ
diff --git a/ios/29.png b/ios/29.png
deleted file mode 100644
index cd49565..0000000
Binary files a/ios/29.png and /dev/null differ
diff --git a/ios/32.png b/ios/32.png
deleted file mode 100644
index a04f4e5..0000000
Binary files a/ios/32.png and /dev/null differ
diff --git a/ios/40.png b/ios/40.png
deleted file mode 100644
index 00ab2ac..0000000
Binary files a/ios/40.png and /dev/null differ
diff --git a/ios/50.png b/ios/50.png
deleted file mode 100644
index 123b4a5..0000000
Binary files a/ios/50.png and /dev/null differ
diff --git a/ios/512.png b/ios/512.png
deleted file mode 100644
index b50ba8e..0000000
Binary files a/ios/512.png and /dev/null differ
diff --git a/ios/57.png b/ios/57.png
deleted file mode 100644
index 2ff9cd0..0000000
Binary files a/ios/57.png and /dev/null differ
diff --git a/ios/58.png b/ios/58.png
deleted file mode 100644
index 47666de..0000000
Binary files a/ios/58.png and /dev/null differ
diff --git a/ios/60.png b/ios/60.png
deleted file mode 100644
index ce6547e..0000000
Binary files a/ios/60.png and /dev/null differ
diff --git a/ios/64.png b/ios/64.png
deleted file mode 100644
index 81ebf8e..0000000
Binary files a/ios/64.png and /dev/null differ
diff --git a/ios/72.png b/ios/72.png
deleted file mode 100644
index 91a14b7..0000000
Binary files a/ios/72.png and /dev/null differ
diff --git a/ios/76.png b/ios/76.png
deleted file mode 100644
index c3ca38e..0000000
Binary files a/ios/76.png and /dev/null differ
diff --git a/ios/80.png b/ios/80.png
deleted file mode 100644
index 3d58bea..0000000
Binary files a/ios/80.png and /dev/null differ
diff --git a/ios/87.png b/ios/87.png
deleted file mode 100644
index 1115b5e..0000000
Binary files a/ios/87.png and /dev/null differ
diff --git a/manifest.json b/manifest.json
deleted file mode 100644
index d946f89..0000000
--- a/manifest.json
+++ /dev/null
@@ -1,131 +0,0 @@
-{
-  "id": "/boolean-function-minimizer/",
-  "name": "多輸出布林函數最小化工具",
-  "short_name": "Boolean Minimizer",
-  "description": "基於 Patrick Method 的多輸出布林函數最小化工具，支援PI和Minterm兩種輸入模式",
-  "start_url": "./index.html",
-  "scope": "./",
-  "display": "standalone",
-  "display_override": ["window-controls-overlay", "standalone"],
-  "background_color": "#ffffff",
-  "theme_color": "#667eea",
-  "orientation": "portrait-primary",
-  "dir": "ltr",
-  "lang": "zh-TW",
-  "launch_handler": {
-    "client_mode": "navigate-existing"
-  },
-  "prefer_related_applications": false,
-  "edge_side_panel": {
-    "preferred_width": 400
-  },
-  "icons": [
-    {
-      "src": "android/android-launchericon-48-48.png",
-      "sizes": "48x48",
-      "type": "image/png",
-      "purpose": "any"
-    },
-    {
-      "src": "android/android-launchericon-72-72.png",
-      "sizes": "72x72",
-      "type": "image/png",
-      "purpose": "any"
-    },
-    {
-      "src": "android/android-launchericon-96-96.png",
-      "sizes": "96x96",
-      "type": "image/png",
-      "purpose": "any"
-    },
-    {
-      "src": "android/android-launchericon-144-144.png",
-      "sizes": "144x144",
-      "type": "image/png",
-      "purpose": "any"
-    },
-    {
-      "src": "android/android-launchericon-192-192.png",
-      "sizes": "192x192",
-      "type": "image/png",
-      "purpose": "any"
-    },
-    {
-      "src": "android/android-launchericon-512-512.png",
-      "sizes": "512x512",
-      "type": "image/png",
-      "purpose": "any"
-    },
-    {
-      "src": "android/android-launchericon-512-512.png",
-      "sizes": "512x512",
-      "type": "image/png",
-      "purpose": "maskable"
-    }
-  ],
-  "file_handlers": [
-    {
-      "action": "./",
-      "accept": {
-        "text/plain": [".txt"],
-        "application/json": [".json"]
-      },
-      "icons": [
-        {
-          "src": "android/android-launchericon-96-96.png",
-          "sizes": "96x96",
-          "type": "image/png"
-        }
-      ]
-    }
-  ],
-  "share_target": {
-    "action": "./",
-    "method": "GET",
-    "params": {
-      "title": "title",
-      "text": "text",
-      "url": "url"
-    }
-  },
-  "shortcuts": [
-    {
-      "name": "PI模式輸入",
-      "short_name": "PI Mode",
-      "description": "直接進入PI模式進行布林函數輸入",
-      "url": "./?mode=pi",
-      "icons": [
-        {
-          "src": "android/android-launchericon-96-96.png",
-          "sizes": "96x96",
-          "type": "image/png"
-        }
-      ]
-    },
-    {
-      "name": "Minterm模式輸入",
-      "short_name": "Minterm Mode", 
-      "description": "直接進入Minterm模式進行布林函數輸入",
-      "url": "./?mode=minterm",
-      "icons": [
-        {
-          "src": "android/android-launchericon-96-96.png",
-          "sizes": "96x96",
-          "type": "image/png"
-        }
-      ]
-    }
-  ],
-  "categories": [
-    "education",
-    "utilities"
-  ],
-  "screenshots": [
-    {
-      "src": "data:image/svg+xml;base64,PHN2ZyB3aWR0aD0iMTI4MCIgaGVpZ2h0PSI3MjAiIHZpZXdCb3g9IjAgMCAxMjgwIDcyMCIgZmlsbD0ibm9uZSIgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIj4KPHJlY3Qgd2lkdGg9IjEyODAiIGhlaWdodD0iNzIwIiBmaWxsPSIjZjhmOWZhIi8+Cjx0ZXh0IHg9IjY0MCIgeT0iMzYwIiB0ZXh0LWFuY2hvcj0ibWlkZGxlIiBmaWxsPSIjMzc0MTUxIiBmb250LXNpemU9IjQ4IiBmb250LWZhbWlseT0iQXJpYWwiPuW4g+WwlOWHveaVuOacgOWwj+WMluW3peWFtzwvdGV4dD4KPC9zdmc+",
-      "sizes": "1280x720",
-      "type": "image/svg+xml",
-      "form_factor": "wide"
-    }
-  ]
-}
\ No newline at end of file
diff --git a/package-lock.json b/package-lock.json
new file mode 100644
index 0000000..74be9ab
--- /dev/null
+++ b/package-lock.json
@@ -0,0 +1,2862 @@
+{
+  "name": "boolean-function-minimizer",
+  "version": "2.0.0",
+  "lockfileVersion": 3,
+  "requires": true,
+  "packages": {
+    "": {
+      "name": "boolean-function-minimizer",
+      "version": "2.0.0",
+      "devDependencies": {
+        "@emnapi/core": "^2.0.0-alpha.3",
+        "@emnapi/runtime": "^2.0.0-alpha.3",
+        "@eslint/js": "^10.0.1",
+        "@playwright/test": "^1.62.0",
+        "@types/node": "^26.1.2",
+        "@vitest/coverage-v8": "^4.1.10",
+        "eslint": "^10.8.0",
+        "fast-check": "^4.9.0",
+        "prettier": "^3.9.6",
+        "typescript": "^6.0.3",
+        "typescript-eslint": "^8.65.0",
+        "vite": "^8.1.5",
+        "vitest": "^4.1.10"
+      },
+      "engines": {
+        "node": ">=24",
+        "npm": ">=11"
+      }
+    },
+    "node_modules/@babel/helper-string-parser": {
+      "version": "7.29.7",
+      "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.29.7.tgz",
+      "integrity": "sha512-Pb5ijPrZ89GDH8223L4UP8i6QApWxs04RbPQJTeWDV0/keR2E36MeKnyr6LYmUUvqRRI+Iv87SuF1W6ErINzYw==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-validator-identifier": {
+      "version": "7.29.7",
+      "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.29.7.tgz",
+      "integrity": "sha512-qehxGkRj55h/ff8EMaJ+cYhyaKlHIxqYDn682wQD7RNp9UujOQsHog2uS0r2vzr4pW+sXf90NeeayjcNaX3fFg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/parser": {
+      "version": "7.29.7",
+      "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.29.7.tgz",
+      "integrity": "sha512-hnORnjP/1P/zFEndoeX+n+t1RwWRJiJpM/jO7FW32Kn9r5+sJB2JWOdYo4L6k78j15eCwY3Gm/7364B1EMwtNg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@babel/types": "^7.29.7"
+      },
+      "bin": {
+        "parser": "bin/babel-parser.js"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@babel/types": {
+      "version": "7.29.7",
+      "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.29.7.tgz",
+      "integrity": "sha512-4zBIxpPzowiZpusoFkyGVwakdRJUyuH5PxQ/PrqghfdFWWasvnCdPfQXHrenDai+gyLARulZjZowCOj6fjT4pA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-string-parser": "^7.29.7",
+        "@babel/helper-validator-identifier": "^7.29.7"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@bcoe/v8-coverage": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/@bcoe/v8-coverage/-/v8-coverage-1.0.2.tgz",
+      "integrity": "sha512-6zABk/ECA/QYSCQ1NGiVwwbQerUCZ+TQbp64Q3AgmfNvurHH0j8TtXa1qbShXA6qqkpAj4V5W8pP6mLe1mcMqA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=18"
+      }
+    },
+    "node_modules/@emnapi/core": {
+      "version": "2.0.0-alpha.3",
+      "resolved": "https://registry.npmjs.org/@emnapi/core/-/core-2.0.0-alpha.3.tgz",
+      "integrity": "sha512-AZypUeJ/yByuxyS7BlSNRDOMLMlROYtjYdIAuBmJssVz1UJDSeYxLrdizhXCFYhedC5bqd/ASy8EuNXbVVXp9g==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@emnapi/wasi-threads": "2.0.1",
+        "tslib": "^2.4.0"
+      }
+    },
+    "node_modules/@emnapi/runtime": {
+      "version": "2.0.0-alpha.3",
+      "resolved": "https://registry.npmjs.org/@emnapi/runtime/-/runtime-2.0.0-alpha.3.tgz",
+      "integrity": "sha512-hFPAhMUjJD9BSyCANEISPOogeXC9Zo9ZQl7L6vKnaVsMkCtzznaW/naYypeyl0Gv5rYfWYsZbpixTMpjDJzQeA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "tslib": "^2.4.0"
+      }
+    },
+    "node_modules/@emnapi/wasi-threads": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/@emnapi/wasi-threads/-/wasi-threads-2.0.1.tgz",
+      "integrity": "sha512-9DsSk+o5NBX0CCJT8s0EROGSGxjR/tKu6aBTaVyq+SjAEQH4XcdcRxPBRzsBLizTTJ49MJjF+jgu3qnO9GLQcQ==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "tslib": "^2.4.0"
+      }
+    },
+    "node_modules/@eslint-community/eslint-utils": {
+      "version": "4.10.1",
+      "resolved": "https://registry.npmjs.org/@eslint-community/eslint-utils/-/eslint-utils-4.10.1.tgz",
+      "integrity": "sha512-cuadcxVFE8sDK6iWJbs8Sn0av2Nrh2QSGQhVlBW9AaAHqHwjWsZHT8LJ4hFGPh7ASBV2deFdM7H/DPjulmh8rg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "eslint-visitor-keys": "^3.4.3"
+      },
+      "engines": {
+        "node": "^12.22.0 || ^14.17.0 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://opencollective.com/eslint"
+      },
+      "peerDependencies": {
+        "eslint": "^6.0.0 || ^7.0.0 || >=8.0.0"
+      }
+    },
+    "node_modules/@eslint-community/eslint-utils/node_modules/eslint-visitor-keys": {
+      "version": "3.4.3",
+      "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-3.4.3.tgz",
+      "integrity": "sha512-wpc+LXeiyiisxPlEkUzU6svyS1frIO3Mgxj1fdy7Pm8Ygzguax2N3Fa/D/ag1WqbOprdI+uY6wMUl8/a2G+iag==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": "^12.22.0 || ^14.17.0 || >=16.0.0"
+      },
+      "funding": {
+        "url": "https://opencollective.com/eslint"
+      }
+    },
+    "node_modules/@eslint-community/regexpp": {
+      "version": "4.12.2",
+      "resolved": "https://registry.npmjs.org/@eslint-community/regexpp/-/regexpp-4.12.2.tgz",
+      "integrity": "sha512-EriSTlt5OC9/7SXkRSCAhfSxxoSUgBm33OH+IkwbdpgoqsSsUg7y3uh+IICI/Qg4BBWr3U2i39RpmycbxMq4ew==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": "^12.0.0 || ^14.0.0 || >=16.0.0"
+      }
+    },
+    "node_modules/@eslint/config-array": {
+      "version": "0.23.5",
+      "resolved": "https://registry.npmjs.org/@eslint/config-array/-/config-array-0.23.5.tgz",
+      "integrity": "sha512-Y3kKLvC1dvTOT+oGlqNQ1XLqK6D1HU2YXPc52NmAlJZbMMWDzGYXMiPRJ8TYD39muD/OTjlZmNJ4ib7dvSrMBA==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@eslint/object-schema": "^3.0.5",
+        "debug": "^4.3.1",
+        "minimatch": "^10.2.4"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      }
+    },
+    "node_modules/@eslint/config-helpers": {
+      "version": "0.7.0",
+      "resolved": "https://registry.npmjs.org/@eslint/config-helpers/-/config-helpers-0.7.0.tgz",
+      "integrity": "sha512-DObd/KKUsU+FaFv4PLxSRenpXfQWmPXXP3pPZ6/K1PCrMu2vQpMDMuQe/BqYeoLcz8ro0bVDF1RxOJgfVEdhUw==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@eslint/core": "^1.2.1"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      }
+    },
+    "node_modules/@eslint/core": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/@eslint/core/-/core-1.2.1.tgz",
+      "integrity": "sha512-MwcE1P+AZ4C6DWlpin/OmOA54mmIZ/+xZuJiQd4SyB29oAJjN30UW9wkKNptW2ctp4cEsvhlLY/CsQ1uoHDloQ==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@types/json-schema": "^7.0.15"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      }
+    },
+    "node_modules/@eslint/js": {
+      "version": "10.0.1",
+      "resolved": "https://registry.npmjs.org/@eslint/js/-/js-10.0.1.tgz",
+      "integrity": "sha512-zeR9k5pd4gxjZ0abRoIaxdc7I3nDktoXZk2qOv9gCNWx3mVwEn32VRhyLaRsDiJjTs0xq/T8mfPtyuXu7GWBcA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      },
+      "funding": {
+        "url": "https://eslint.org/donate"
+      },
+      "peerDependencies": {
+        "eslint": "^10.0.0"
+      },
+      "peerDependenciesMeta": {
+        "eslint": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@eslint/object-schema": {
+      "version": "3.0.5",
+      "resolved": "https://registry.npmjs.org/@eslint/object-schema/-/object-schema-3.0.5.tgz",
+      "integrity": "sha512-vqTaUEgxzm+YDSdElad6PiRoX4t8VGDjCtt05zn4nU810UIx/uNEV7/lZJ6KwFThKZOzOxzXy48da+No7HZaMw==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      }
+    },
+    "node_modules/@eslint/plugin-kit": {
+      "version": "0.7.2",
+      "resolved": "https://registry.npmjs.org/@eslint/plugin-kit/-/plugin-kit-0.7.2.tgz",
+      "integrity": "sha512-+CNAzxglkrpNf/kKywqQfk74QjtceuOE7Qm+AF8miRvPF/wmmK5+OJOgVh3AVTT3RP2mH3+FOaxlE5v72owk0A==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@eslint/core": "^1.2.1",
+        "levn": "^0.4.1"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      }
+    },
+    "node_modules/@humanfs/core": {
+      "version": "0.19.2",
+      "resolved": "https://registry.npmjs.org/@humanfs/core/-/core-0.19.2.tgz",
+      "integrity": "sha512-UhXNm+CFMWcbChXywFwkmhqjs3PRCmcSa/hfBgLIb7oQ5HNb1wS0icWsGtSAUNgefHeI+eBrA8I1fxmbHsGdvA==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@humanfs/types": "^0.15.0"
+      },
+      "engines": {
+        "node": ">=18.18.0"
+      }
+    },
+    "node_modules/@humanfs/node": {
+      "version": "0.16.8",
+      "resolved": "https://registry.npmjs.org/@humanfs/node/-/node-0.16.8.tgz",
+      "integrity": "sha512-gE1eQNZ3R++kTzFUpdGlpmy8kDZD/MLyHqDwqjkVQI0JMdI1D51sy1H958PNXYkM2rAac7e5/CnIKZrHtPh3BQ==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@humanfs/core": "^0.19.2",
+        "@humanfs/types": "^0.15.0",
+        "@humanwhocodes/retry": "^0.4.0"
+      },
+      "engines": {
+        "node": ">=18.18.0"
+      }
+    },
+    "node_modules/@humanfs/types": {
+      "version": "0.15.0",
+      "resolved": "https://registry.npmjs.org/@humanfs/types/-/types-0.15.0.tgz",
+      "integrity": "sha512-ZZ1w0aoQkwuUuC7Yf+7sdeaNfqQiiLcSRbfI08oAxqLtpXQr9AIVX7Ay7HLDuiLYAaFPu8oBYNq/QIi9URHJ3Q==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=18.18.0"
+      }
+    },
+    "node_modules/@humanwhocodes/module-importer": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/@humanwhocodes/module-importer/-/module-importer-1.0.1.tgz",
+      "integrity": "sha512-bxveV4V8v5Yb4ncFTT3rPSgZBOpCkjfK0y4oVVVJwIuDVBRMDXrPyXRL988i5ap9m9bnyEEjWfm5WkBmtffLfA==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=12.22"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/nzakas"
+      }
+    },
+    "node_modules/@humanwhocodes/retry": {
+      "version": "0.4.3",
+      "resolved": "https://registry.npmjs.org/@humanwhocodes/retry/-/retry-0.4.3.tgz",
+      "integrity": "sha512-bV0Tgo9K4hfPCek+aMAn81RppFKv2ySDQeMoSZuvTASywNTnVJCArCZE2FWqpvIatKu7VMRLWlR1EazvVhDyhQ==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=18.18"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/nzakas"
+      }
+    },
+    "node_modules/@jridgewell/resolve-uri": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/@jridgewell/resolve-uri/-/resolve-uri-3.1.2.tgz",
+      "integrity": "sha512-bRISgCIjP20/tbWSPWMEi54QVPRZExkuD9lJL+UIxUKtwVJA8wW1Trb1jMs1RFXo1CBTNZ/5hpC9QvmKWdopKw==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@jridgewell/sourcemap-codec": {
+      "version": "1.5.5",
+      "resolved": "https://registry.npmjs.org/@jridgewell/sourcemap-codec/-/sourcemap-codec-1.5.5.tgz",
+      "integrity": "sha512-cYQ9310grqxueWbl+WuIUIaiUaDcj7WOq5fVhEljNVgRfOUhY9fy2zTvfoqWsnebh8Sl70VScFbICvJnLKB0Og==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@jridgewell/trace-mapping": {
+      "version": "0.3.31",
+      "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.31.tgz",
+      "integrity": "sha512-zzNR+SdQSDJzc8joaeP8QQoCQr8NuYx2dIIytl1QeBEZHJ9uW6hebsrYgbz8hJwUQao3TWCMtmfV8Nu1twOLAw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/resolve-uri": "^3.1.0",
+        "@jridgewell/sourcemap-codec": "^1.4.14"
+      }
+    },
+    "node_modules/@napi-rs/wasm-runtime": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/@napi-rs/wasm-runtime/-/wasm-runtime-1.2.0.tgz",
+      "integrity": "sha512-kDoONqMa+VnZ4vvvu/ZUurpJ4gkZU57e7g69qpNgWhYcZFPUHZM2CEMKm+cG6ufDVALbjMvfmMjFVqaK7uEMnA==",
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "@tybys/wasm-util": "^0.10.3"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=23.5.0"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/Brooooooklyn"
+      },
+      "peerDependencies": {
+        "@emnapi/core": "^2.0.0-alpha.3",
+        "@emnapi/runtime": "^2.0.0-alpha.3"
+      }
+    },
+    "node_modules/@oxc-project/types": {
+      "version": "0.139.0",
+      "resolved": "https://registry.npmjs.org/@oxc-project/types/-/types-0.139.0.tgz",
+      "integrity": "sha512-r9gHphtCs+1M7J0pw6Sn/hh/Wpa/iQrOOkrNAlVLF/gHq+/CJmHIWKKUUhdWjcD6CIa8idarspCsASiXCXvFUw==",
+      "dev": true,
+      "license": "MIT",
+      "funding": {
+        "url": "https://github.com/sponsors/Boshen"
+      }
+    },
+    "node_modules/@playwright/test": {
+      "version": "1.62.0",
+      "resolved": "https://registry.npmjs.org/@playwright/test/-/test-1.62.0.tgz",
+      "integrity": "sha512-9zOJ6ZQRAena31MpOH9VSzIz8Ou3YJ/wtY/eQm5T2uhfhG7/U3COrMS8xOtUrZrp9OgdmzEnIYODye3nY1VqzA==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "playwright": "1.62.0"
+      },
+      "bin": {
+        "playwright": "cli.js"
+      },
+      "engines": {
+        "node": ">=20"
+      }
+    },
+    "node_modules/@rolldown/binding-android-arm64": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-android-arm64/-/binding-android-arm64-1.1.5.tgz",
+      "integrity": "sha512-lZg8fqIv2v7FF237bwMgzGZEJvGL79/s5knJ/i6FmsGF4XXlzccZ4jb+TrFIxtSSxFtIpdsgrPZeMk1I9AFcyQ==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "android"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-darwin-arm64": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-arm64/-/binding-darwin-arm64-1.1.5.tgz",
+      "integrity": "sha512-51Bnx9pNiMRKSUNtBfySkNJ9vMU9Hh3I1ozDd6gyPPYzaXCfnptUcEZxXGYFn+ul2dtcMUiqGR1Yai2K10uoTw==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-darwin-x64": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-x64/-/binding-darwin-x64-1.1.5.tgz",
+      "integrity": "sha512-Tm+gbfC0aHu1tBA/JvKQh32S0K6YgCHkiAF4/W6xX0K0RmNuc94VeK419dJoE65R5aRxmo+noZQSWrAMF6yb6g==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-freebsd-x64": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-freebsd-x64/-/binding-freebsd-x64-1.1.5.tgz",
+      "integrity": "sha512-JMzDKCCXq93YccG5gz3hvOs1oXRKAf0XYpfOS88e+wZrC8Iugj6j68867vrYZkvpDDpKn/KoKORThmchMpF6TA==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "freebsd"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-linux-arm-gnueabihf": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm-gnueabihf/-/binding-linux-arm-gnueabihf-1.1.5.tgz",
+      "integrity": "sha512-uML21j2K5TfPGutKxub+M+nLjZIrWjXQ5Grx4lCe/nimTj9B4L63zHpjXLl4y0L3mcm2htEQIb06oCG/szerNw==",
+      "cpu": [
+        "arm"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-linux-arm64-gnu": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-gnu/-/binding-linux-arm64-gnu-1.1.5.tgz",
+      "integrity": "sha512-navSiuTMogvnQoZoM/v+l3ZWo50/NTwSHSzheABx/RCnmUPaKwq9qSo4Br2OYRs21+Fz8uFqITZM3H4opOB0/Q==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-linux-arm64-musl": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-musl/-/binding-linux-arm64-musl-1.1.5.tgz",
+      "integrity": "sha512-lAryqH7IteztmCXQXk0etKj4wBQ7Gx5S6LjKhsgp9zb8I5bsuvU/2llH1hDQcjsFeqIsovMVN339/8pUDDBXxA==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-linux-ppc64-gnu": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-ppc64-gnu/-/binding-linux-ppc64-gnu-1.1.5.tgz",
+      "integrity": "sha512-fsK/sNBnxzBlL4O1JNrZakVQxPspqpED5dLtNsZS9oOKmtSpdNIzxH2kkol5HYTWJN47sE20ztMJPxfZ89qGOg==",
+      "cpu": [
+        "ppc64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-linux-s390x-gnu": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-s390x-gnu/-/binding-linux-s390x-gnu-1.1.5.tgz",
+      "integrity": "sha512-gLYb4BIadlfTOYT5gO503n8zQjXflgzpD0FcyKh0Mzx3rqCZKnHoJWV9xe1KXUJ5lx2JfcSHr/mhzS0PC/McAA==",
+      "cpu": [
+        "s390x"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-linux-x64-gnu": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-gnu/-/binding-linux-x64-gnu-1.1.5.tgz",
+      "integrity": "sha512-FjcpEKUyJygHgs1o50VYNvkt5+7Le/VEdYt0AkRpkL33MnyQfwr8l5mXwMmfmTbyMPr5vJLC+8/Gd9gXnwU1QQ==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-linux-x64-musl": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-musl/-/binding-linux-x64-musl-1.1.5.tgz",
+      "integrity": "sha512-Me+PfPI2TMeOQk0gYWfLQZtTktrmzbr8cDboqX83XKc7UrgAi55gF+2dUkWdxd19n55Essp2yeca+O9N5rBxHg==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-openharmony-arm64": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-openharmony-arm64/-/binding-openharmony-arm64-1.1.5.tgz",
+      "integrity": "sha512-yc5WrLzXks6zCQfn9Oxr8pORKyl/pF+QjHmW/Qx3qu0oyrrNC+y2JLTU1E2rcWYAmzlnqngWXHQjy51VzW70Vw==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "openharmony"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-wasm32-wasi": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-wasm32-wasi/-/binding-wasm32-wasi-1.1.5.tgz",
+      "integrity": "sha512-VbQGPX2b4r48TAMIM2cjgluIM1HYutm4pcTEJsle7iEP7sB1dFqtPLBVbdLAZCxy1txCcPxf4QFf4v8uvltPqA==",
+      "cpu": [
+        "wasm32"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "@emnapi/core": "1.11.1",
+        "@emnapi/runtime": "1.11.1",
+        "@napi-rs/wasm-runtime": "^1.1.6"
+      },
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-wasm32-wasi/node_modules/@emnapi/core": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@emnapi/core/-/core-1.11.1.tgz",
+      "integrity": "sha512-RSvbQmHzdKzNsLYa/wHrbc3KN4sYLKAdPZxqiM2HATqv/SBk2/ENSHpvXGaLOMcsAyz0poEGqkmmKYG3OWiJEQ==",
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "@emnapi/wasi-threads": "1.2.2",
+        "tslib": "^2.4.0"
+      }
+    },
+    "node_modules/@rolldown/binding-wasm32-wasi/node_modules/@emnapi/runtime": {
+      "version": "1.11.1",
+      "resolved": "https://registry.npmjs.org/@emnapi/runtime/-/runtime-1.11.1.tgz",
+      "integrity": "sha512-vgj7R3y3Wgx24IQaGPA/R6YFXLHVMOZ0uVEyIQPaWs+rd1AzfEMXlAC22FYwO1XkKR6NPsq7mUandH8oIRdZFw==",
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "tslib": "^2.4.0"
+      }
+    },
+    "node_modules/@rolldown/binding-wasm32-wasi/node_modules/@emnapi/wasi-threads": {
+      "version": "1.2.2",
+      "resolved": "https://registry.npmjs.org/@emnapi/wasi-threads/-/wasi-threads-1.2.2.tgz",
+      "integrity": "sha512-c95qOXkHdydNKhscBTebqEC1CVAZpyqOfVfBzQ1qgzyl3gfeldUjIggDbIZgDKsHLgnsM+igH7TJ/eAasaVuMA==",
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "tslib": "^2.4.0"
+      }
+    },
+    "node_modules/@rolldown/binding-win32-arm64-msvc": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-arm64-msvc/-/binding-win32-arm64-msvc-1.1.5.tgz",
+      "integrity": "sha512-gHv82k63z4qpV5+Q1y/12KrK0ltWBukVDI8nZcbT7Tt/ZlOIVwppazneq0F93oDxTo3IgAMEDIoQh3E2n6mVsw==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "win32"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/binding-win32-x64-msvc": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-x64-msvc/-/binding-win32-x64-msvc-1.1.5.tgz",
+      "integrity": "sha512-tTZuDBPw85tEN5PQi1pnEBzDy0Z49HtScLAbD5t6hyeU92A95pRWaSMw1GZZi/RwgSgUIl0xrSlXIT/9QzvYSA==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "win32"
+      ],
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      }
+    },
+    "node_modules/@rolldown/pluginutils": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/@rolldown/pluginutils/-/pluginutils-1.0.1.tgz",
+      "integrity": "sha512-2j9bGt5Jh8hj+vPtgzPtl72j0yRxHAyumoo6TNfAjsLB04UtpSvPbPcDcBMxz7n+9CYB0c1GxQFxYRg2jimqGw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@standard-schema/spec": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/@standard-schema/spec/-/spec-1.1.0.tgz",
+      "integrity": "sha512-l2aFy5jALhniG5HgqrD6jXLi/rUWrKvqN/qJx6yoJsgKhblVd+iqqU4RCXavm/jPityDo5TCvKMnpjKnOriy0w==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@tybys/wasm-util": {
+      "version": "0.10.3",
+      "resolved": "https://registry.npmjs.org/@tybys/wasm-util/-/wasm-util-0.10.3.tgz",
+      "integrity": "sha512-F3fo1MYrRJYL3zER0OUOmkutjr1Vp23m7OsSgp7nq4SP6OqX6C/56XFIPAl5bt3zaBRjmW7SGz3u/6LwFpYcOg==",
+      "dev": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "tslib": "^2.4.0"
+      }
+    },
+    "node_modules/@types/chai": {
+      "version": "5.2.3",
+      "resolved": "https://registry.npmjs.org/@types/chai/-/chai-5.2.3.tgz",
+      "integrity": "sha512-Mw558oeA9fFbv65/y4mHtXDs9bPnFMZAL/jxdPFUpOHHIXX91mcgEHbS5Lahr+pwZFR8A7GQleRWeI6cGFC2UA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@types/deep-eql": "*",
+        "assertion-error": "^2.0.1"
+      }
+    },
+    "node_modules/@types/deep-eql": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@types/deep-eql/-/deep-eql-4.0.2.tgz",
+      "integrity": "sha512-c9h9dVVMigMPc4bwTvC5dxqtqJZwQPePsWjPlpSOnojbor6pGqdk541lfA7AqFQr5pB1BRdq0juY9db81BwyFw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@types/esrecurse": {
+      "version": "4.3.1",
+      "resolved": "https://registry.npmjs.org/@types/esrecurse/-/esrecurse-4.3.1.tgz",
+      "integrity": "sha512-xJBAbDifo5hpffDBuHl0Y8ywswbiAp/Wi7Y/GtAgSlZyIABppyurxVueOPE8LUQOxdlgi6Zqce7uoEpqNTeiUw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@types/estree": {
+      "version": "1.0.9",
+      "resolved": "https://registry.npmjs.org/@types/estree/-/estree-1.0.9.tgz",
+      "integrity": "sha512-GhdPgy1el4/ImP05X05Uw4cw2/M93BCUmnEvWZNStlCzEKME4Fkk+YpoA5OiHNQmoS7Cafb8Xa3Pya8m1Qrzeg==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@types/json-schema": {
+      "version": "7.0.15",
+      "resolved": "https://registry.npmjs.org/@types/json-schema/-/json-schema-7.0.15.tgz",
+      "integrity": "sha512-5+fP8P8MFNC+AyZCDxrB2pkZFPGzqQWUzpSeuuVLvm8VMcorNYavBqoFcxK8bQz4Qsbn4oUEEem4wDLfcysGHA==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/@types/node": {
+      "version": "26.1.2",
+      "resolved": "https://registry.npmjs.org/@types/node/-/node-26.1.2.tgz",
+      "integrity": "sha512-Vu4a5UFA9rIIFJ7rB/Vaafh9lrCQszopTCx6KjFboXTGQbPNasehVR5TEiithSDGyd1DEiUByggTZsg8jukeIg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "undici-types": "~8.3.0"
+      }
+    },
+    "node_modules/@typescript-eslint/eslint-plugin": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/eslint-plugin/-/eslint-plugin-8.65.0.tgz",
+      "integrity": "sha512-IEgob78X12rHpUmtcwFsXhZdVGJtwTVP8FiCLZkR6GlYVrl2PcuB+KhCE5BlVC/eQpQnu8WXRtkHZuPar+gCRA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@eslint-community/regexpp": "^4.12.2",
+        "@typescript-eslint/scope-manager": "8.65.0",
+        "@typescript-eslint/type-utils": "8.65.0",
+        "@typescript-eslint/utils": "8.65.0",
+        "@typescript-eslint/visitor-keys": "8.65.0",
+        "ignore": "^7.0.5",
+        "natural-compare": "^1.4.0",
+        "ts-api-utils": "^2.5.0"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "@typescript-eslint/parser": "^8.65.0",
+        "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0",
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/@typescript-eslint/eslint-plugin/node_modules/ignore": {
+      "version": "7.0.6",
+      "resolved": "https://registry.npmjs.org/ignore/-/ignore-7.0.6.tgz",
+      "integrity": "sha512-BAg6QkE8W+TuQLrrw0Ugr7HegXduRuuj8/ti2kSOc+jz1dmx8/WNcjr6XGnq5YpDWxFwwaavqD0+jIUOKelTsw==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 4"
+      }
+    },
+    "node_modules/@typescript-eslint/parser": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/parser/-/parser-8.65.0.tgz",
+      "integrity": "sha512-CZ4nMxWwgu1HEEFNkeaCptra9QCtkmKdgf3sWh1rl1trIhmxLilgTV4cwcbQ4wemnT4sWQN8CaKOmdYx+g2gMA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@typescript-eslint/scope-manager": "8.65.0",
+        "@typescript-eslint/types": "8.65.0",
+        "@typescript-eslint/typescript-estree": "8.65.0",
+        "@typescript-eslint/visitor-keys": "8.65.0",
+        "debug": "^4.4.3"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0",
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/@typescript-eslint/project-service": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/project-service/-/project-service-8.65.0.tgz",
+      "integrity": "sha512-SxnPhbTsGahizDgbu7oqFH/xVtzIqMd/s+WtnSxNxJZJpLbdT5IPdzg8EZxO3+PoKahXmwJLeNQOpKJb3/bi7Q==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@typescript-eslint/tsconfig-utils": "^8.65.0",
+        "@typescript-eslint/types": "^8.65.0",
+        "debug": "^4.4.3"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/@typescript-eslint/scope-manager": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/scope-manager/-/scope-manager-8.65.0.tgz",
+      "integrity": "sha512-Esbl8OSYiVxBokYgWPf7VVWg/BE798wXhimnn9ML9Pt5qoDf8bfQlgjlKXR/k98+AcNzlLKYrpCcrcuZ9DZLgg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@typescript-eslint/types": "8.65.0",
+        "@typescript-eslint/visitor-keys": "8.65.0"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      }
+    },
+    "node_modules/@typescript-eslint/tsconfig-utils": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/tsconfig-utils/-/tsconfig-utils-8.65.0.tgz",
+      "integrity": "sha512-j6GzGqCiRdA7Qhur2VVmKZAkBLfnHFQfx4TaJGL9RMveZqCo48jSHHO0DTgizEnGhtWnqmbtCUSrqSkdiY/0Hg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/@typescript-eslint/type-utils": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/type-utils/-/type-utils-8.65.0.tgz",
+      "integrity": "sha512-YjaZ7PRI5qY7ax2L3PbvX0rRyGtipAReCWs0mhhDBHjH/vl0g0BonaGXrKdKpMbIIsMIwDgbk/xzkBTyAltS5g==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@typescript-eslint/types": "8.65.0",
+        "@typescript-eslint/typescript-estree": "8.65.0",
+        "@typescript-eslint/utils": "8.65.0",
+        "debug": "^4.4.3",
+        "ts-api-utils": "^2.5.0"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0",
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/@typescript-eslint/types": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/types/-/types-8.65.0.tgz",
+      "integrity": "sha512-JSSwWNy+H0E/01jJEM+hrX6N0OFDzFzeIhHFSAS01tlVaevpG8cFyYRPhS5yjGOvBUx3sqQHVMjCL1CAZZMxBg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      }
+    },
+    "node_modules/@typescript-eslint/typescript-estree": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/typescript-estree/-/typescript-estree-8.65.0.tgz",
+      "integrity": "sha512-JboAE2swaYt4tb1fHhHTABE2K+OLy09XfcTbhnk4Pw96f9dd2e9iYsJ28gBggHlo5z5x1rkyWvcPoTuNTd4oGg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@typescript-eslint/project-service": "8.65.0",
+        "@typescript-eslint/tsconfig-utils": "8.65.0",
+        "@typescript-eslint/types": "8.65.0",
+        "@typescript-eslint/visitor-keys": "8.65.0",
+        "debug": "^4.4.3",
+        "minimatch": "^10.2.2",
+        "semver": "^7.7.3",
+        "tinyglobby": "^0.2.15",
+        "ts-api-utils": "^2.5.0"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/@typescript-eslint/utils": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/utils/-/utils-8.65.0.tgz",
+      "integrity": "sha512-gXiwIHsYreboxeJucHKPvgwl7dXt50mF8s1/c00cP/WoVTyWKFdtfhRWwZiXYFU5H2O8vVoSLNrexFZjYS/SGA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@eslint-community/eslint-utils": "^4.9.1",
+        "@typescript-eslint/scope-manager": "8.65.0",
+        "@typescript-eslint/types": "8.65.0",
+        "@typescript-eslint/typescript-estree": "8.65.0"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0",
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/@typescript-eslint/visitor-keys": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/@typescript-eslint/visitor-keys/-/visitor-keys-8.65.0.tgz",
+      "integrity": "sha512-8C71BQkGjiMmXtop7pHVJu1l2NNShFdkCyD6a2ezzs5vU/L3LRtb69EtcteFwz0mYMPzIgOw0n6OV4VBUWZd7A==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@typescript-eslint/types": "8.65.0",
+        "eslint-visitor-keys": "^5.0.0"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      }
+    },
+    "node_modules/@vitest/coverage-v8": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/coverage-v8/-/coverage-v8-4.1.10.tgz",
+      "integrity": "sha512-IM49HmthevbgAO4anp1hwtoT9wYe59w0LR00gr+eagHE+ZJ5lK4sLPeO0ubgoJcwLk6dehU3R24N+FbEEKDc8g==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@bcoe/v8-coverage": "^1.0.2",
+        "@vitest/utils": "4.1.10",
+        "ast-v8-to-istanbul": "^1.0.0",
+        "istanbul-lib-coverage": "^3.2.2",
+        "istanbul-lib-report": "^3.0.1",
+        "istanbul-reports": "^3.2.0",
+        "magicast": "^0.5.2",
+        "obug": "^2.1.1",
+        "std-env": "^4.0.0-rc.1",
+        "tinyrainbow": "^3.1.0"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      },
+      "peerDependencies": {
+        "@vitest/browser": "4.1.10",
+        "vitest": "4.1.10"
+      },
+      "peerDependenciesMeta": {
+        "@vitest/browser": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@vitest/expect": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/expect/-/expect-4.1.10.tgz",
+      "integrity": "sha512-YsCn+qAk1GWjQOWFEsEcL2gNQ0zmVmQu3T03qP6UyjhtmdtwtbuI+DASn/7iQB3HGTXkdBwGddzxPlmiql5vlA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@standard-schema/spec": "^1.1.0",
+        "@types/chai": "^5.2.2",
+        "@vitest/spy": "4.1.10",
+        "@vitest/utils": "4.1.10",
+        "chai": "^6.2.2",
+        "tinyrainbow": "^3.1.0"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      }
+    },
+    "node_modules/@vitest/mocker": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/mocker/-/mocker-4.1.10.tgz",
+      "integrity": "sha512-v0xaezt+DKEmKfaxg133ldzADrwLGd7Ze1MfQQTYfvs8OqZIwbxyxaYURivwV7sWy5fqn3rH5uOrSp07bp44Ow==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@vitest/spy": "4.1.10",
+        "estree-walker": "^3.0.3",
+        "magic-string": "^0.30.21"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      },
+      "peerDependencies": {
+        "msw": "^2.4.9",
+        "vite": "^6.0.0 || ^7.0.0 || ^8.0.0"
+      },
+      "peerDependenciesMeta": {
+        "msw": {
+          "optional": true
+        },
+        "vite": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@vitest/pretty-format": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/pretty-format/-/pretty-format-4.1.10.tgz",
+      "integrity": "sha512-W1HsjSH4MXQ9YfmmhLAoIYf1HRfekQCGngeIgcei6MP5QQGWUe0gkopdZQaVCFO+JDJMrAJGwa5pRpNpvy4P8Q==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "tinyrainbow": "^3.1.0"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      }
+    },
+    "node_modules/@vitest/runner": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/runner/-/runner-4.1.10.tgz",
+      "integrity": "sha512-IKI6kpIH+LmpROplyLwBBaCfMgOZOMsygVa6BARD6ahA04VRuJSa6OaVG7kRvSEMD870Vd91rSSw0eegtWyLGg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@vitest/utils": "4.1.10",
+        "pathe": "^2.0.3"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      }
+    },
+    "node_modules/@vitest/snapshot": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/snapshot/-/snapshot-4.1.10.tgz",
+      "integrity": "sha512-xRkfOT1qpTAi/Ti4Y1LtfRc3kEuqxGw59eN2jN9pRWMtS/XDevekhcFSqvQqjUNGksfjMJu3Y+oJ+4Ypn2OaJw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@vitest/pretty-format": "4.1.10",
+        "@vitest/utils": "4.1.10",
+        "magic-string": "^0.30.21",
+        "pathe": "^2.0.3"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      }
+    },
+    "node_modules/@vitest/spy": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/spy/-/spy-4.1.10.tgz",
+      "integrity": "sha512-PLf/Ugvoq5wO/b4rwYCR1h2PSIdXz7wnkQFMiUpLdtM7l6pqVFcQIBEHyT1+l+cj7mNwAfZHzqXqDyjvOuwbDw==",
+      "dev": true,
+      "license": "MIT",
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      }
+    },
+    "node_modules/@vitest/utils": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/@vitest/utils/-/utils-4.1.10.tgz",
+      "integrity": "sha512-fy9am/HWxbaGt/Sawrp90vt6Y6jQwf1RX77cz3uwoJwJVMli/e1IEwRPnMNJ7vKfPTwo0diXifkpPvwH9v7nGA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@vitest/pretty-format": "4.1.10",
+        "convert-source-map": "^2.0.0",
+        "tinyrainbow": "^3.1.0"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      }
+    },
+    "node_modules/acorn": {
+      "version": "8.18.0",
+      "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.18.0.tgz",
+      "integrity": "sha512-lGq+9yr1/GuAWaVYIHRjvvySG5/4VfKIvC8EWxStPdcDh/Ka7FG3twP6v4d5BkravUilhIAsG4Qj83t02LWUPQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "bin": {
+        "acorn": "bin/acorn"
+      },
+      "engines": {
+        "node": ">=0.4.0"
+      }
+    },
+    "node_modules/acorn-jsx": {
+      "version": "5.3.2",
+      "resolved": "https://registry.npmjs.org/acorn-jsx/-/acorn-jsx-5.3.2.tgz",
+      "integrity": "sha512-rq9s+JNhf0IChjtDXxllJ7g41oZk5SlXtp0LHwyA5cejwn7vKmKp4pPri6YEePv2PU65sAsegbXtIinmDFDXgQ==",
+      "dev": true,
+      "license": "MIT",
+      "peerDependencies": {
+        "acorn": "^6.0.0 || ^7.0.0 || ^8.0.0"
+      }
+    },
+    "node_modules/ajv": {
+      "version": "6.15.0",
+      "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.15.0.tgz",
+      "integrity": "sha512-fgFx7Hfoq60ytK2c7DhnF8jIvzYgOMxfugjLOSMHjLIPgenqa7S7oaagATUq99mV6IYvN2tRmC0wnTYX6iPbMw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/assertion-error": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/assertion-error/-/assertion-error-2.0.1.tgz",
+      "integrity": "sha512-Izi8RQcffqCeNVgFigKli1ssklIbpHnCYc6AknXGYoB6grJqyeby7jv12JUQgmTAnIDnbck1uxksT4dzN3PWBA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/ast-v8-to-istanbul": {
+      "version": "1.0.5",
+      "resolved": "https://registry.npmjs.org/ast-v8-to-istanbul/-/ast-v8-to-istanbul-1.0.5.tgz",
+      "integrity": "sha512-UPAgKJFSEGMWSDr3LX4tqnAb4f7KGT8O40Tyx8wbYmmZ/yn58lNCm8h3svs3eXgiGd5AXxz8NDOvXWvicq+rJA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/trace-mapping": "^0.3.31",
+        "estree-walker": "^3.0.3",
+        "js-tokens": "^10.0.0"
+      }
+    },
+    "node_modules/balanced-match": {
+      "version": "4.0.4",
+      "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-4.0.4.tgz",
+      "integrity": "sha512-BLrgEcRTwX2o6gGxGOCNyMvGSp35YofuYzw9h1IMTRmKqttAZZVU67bdb9Pr2vUHA8+j3i2tJfjO6C6+4myGTA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": "18 || 20 || >=22"
+      }
+    },
+    "node_modules/brace-expansion": {
+      "version": "5.0.8",
+      "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-5.0.8.tgz",
+      "integrity": "sha512-JZyDyq3D4AUifKTPOB7DELf6XsB3WdPuNxCtob1vFXPsSXhdAiHBWJ/tJ8HAc9aH84BK+5JFZLNkJKx3G9kzQg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "balanced-match": "^4.0.2"
+      },
+      "engines": {
+        "node": "20 || >=22"
+      }
+    },
+    "node_modules/chai": {
+      "version": "6.2.2",
+      "resolved": "https://registry.npmjs.org/chai/-/chai-6.2.2.tgz",
+      "integrity": "sha512-NUPRluOfOiTKBKvWPtSD4PhFvWCqOi0BGStNWs57X9js7XGTprSmFoz5F0tWhR4WPjNeR9jXqdC7/UpSJTnlRg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=18"
+      }
+    },
+    "node_modules/convert-source-map": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/convert-source-map/-/convert-source-map-2.0.0.tgz",
+      "integrity": "sha512-Kvp459HrV2FEJ1CAsi1Ku+MY3kasH19TFykTz2xWmMeq6bk2NU3XXvfJ+Q61m0xktWwt+1HSYf3JZsTms3aRJg==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/cross-spawn": {
+      "version": "7.0.6",
+      "resolved": "https://registry.npmjs.org/cross-spawn/-/cross-spawn-7.0.6.tgz",
+      "integrity": "sha512-uV2QOWP2nWzsy2aMp8aRibhi9dlzF5Hgh5SHaB9OiTGEyDTiJJyx0uy51QXdyWbtAHNua4XJzUKca3OzKUd3vA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "path-key": "^3.1.0",
+        "shebang-command": "^2.0.0",
+        "which": "^2.0.1"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/debug": {
+      "version": "4.4.3",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.3.tgz",
+      "integrity": "sha512-RGwwWnwQvkVfavKVt22FGLw+xYSdzARwm0ru6DhTVA3umU5hZc28V3kO4stgYryrTlLpuvgI9GiijltAjNbcqA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "ms": "^2.1.3"
+      },
+      "engines": {
+        "node": ">=6.0"
+      },
+      "peerDependenciesMeta": {
+        "supports-color": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/deep-is": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/deep-is/-/deep-is-0.1.4.tgz",
+      "integrity": "sha512-oIPzksmTg4/MriiaYGO+okXDT7ztn/w3Eptv/+gSIdMdKsJo0u4CfYNFJPy+4SKMuCqGw2wxnA+URMg3t8a/bQ==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/detect-libc": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/detect-libc/-/detect-libc-2.1.2.tgz",
+      "integrity": "sha512-Btj2BOOO83o3WyH59e8MgXsxEQVcarkUOpEYrubB0urwnN10yQ364rsiByU11nZlqWYZm05i/of7io4mzihBtQ==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/es-module-lexer": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-2.3.1.tgz",
+      "integrity": "sha512-shc1dbU90Yl/xq1QrC7QRtfcwURZuVRfPhZbDoldJ1cn1gzDvBaBWlv0eFolj5+0znnPJz5TXLxsN77X/12KTA==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/escape-string-regexp": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-4.0.0.tgz",
+      "integrity": "sha512-TtpcNJ3XAzx3Gq8sWRzJaVajRs0uVxA2YAkdb1jm2YkPz4G6egUFAyA3n5vtEIZefPk5Wa4UXbKuS5fKkJWdgA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/eslint": {
+      "version": "10.8.0",
+      "resolved": "https://registry.npmjs.org/eslint/-/eslint-10.8.0.tgz",
+      "integrity": "sha512-nuKKvN+oIBO0koN7Tm7dlkmnkc21mtt0QJLwAKzjLq14y6lRTdVG36MZHJ8eQHwdJMwZbQNMlPOYedMq/oVJvQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "workspaces": [
+        "packages/*"
+      ],
+      "dependencies": {
+        "@eslint-community/eslint-utils": "^4.8.0",
+        "@eslint-community/regexpp": "^4.12.2",
+        "@eslint/config-array": "^0.23.5",
+        "@eslint/config-helpers": "^0.7.0",
+        "@eslint/core": "^1.2.1",
+        "@eslint/plugin-kit": "^0.7.2",
+        "@humanfs/node": "^0.16.6",
+        "@humanwhocodes/module-importer": "^1.0.1",
+        "@humanwhocodes/retry": "^0.4.2",
+        "@types/estree": "^1.0.6",
+        "ajv": "^6.14.0",
+        "cross-spawn": "^7.0.6",
+        "debug": "^4.3.2",
+        "escape-string-regexp": "^4.0.0",
+        "eslint-scope": "^9.1.2",
+        "eslint-visitor-keys": "^5.0.1",
+        "espree": "^11.2.0",
+        "esquery": "^1.7.0",
+        "esutils": "^2.0.2",
+        "fast-deep-equal": "^3.1.3",
+        "file-entry-cache": "^8.0.0",
+        "find-up": "^5.0.0",
+        "glob-parent": "^6.0.2",
+        "ignore": "^5.2.0",
+        "imurmurhash": "^0.1.4",
+        "is-glob": "^4.0.0",
+        "json-stable-stringify-without-jsonify": "^1.0.1",
+        "minimatch": "^10.2.5",
+        "natural-compare": "^1.4.0",
+        "optionator": "^0.9.3"
+      },
+      "bin": {
+        "eslint": "bin/eslint.js"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      },
+      "funding": {
+        "url": "https://eslint.org/donate"
+      },
+      "peerDependencies": {
+        "jiti": "*"
+      },
+      "peerDependenciesMeta": {
+        "jiti": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/eslint-scope": {
+      "version": "9.1.2",
+      "resolved": "https://registry.npmjs.org/eslint-scope/-/eslint-scope-9.1.2.tgz",
+      "integrity": "sha512-xS90H51cKw0jltxmvmHy2Iai1LIqrfbw57b79w/J7MfvDfkIkFZ+kj6zC3BjtUwh150HsSSdxXZcsuv72miDFQ==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "@types/esrecurse": "^4.3.1",
+        "@types/estree": "^1.0.8",
+        "esrecurse": "^4.3.0",
+        "estraverse": "^5.2.0"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      },
+      "funding": {
+        "url": "https://opencollective.com/eslint"
+      }
+    },
+    "node_modules/eslint-visitor-keys": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/eslint-visitor-keys/-/eslint-visitor-keys-5.0.1.tgz",
+      "integrity": "sha512-tD40eHxA35h0PEIZNeIjkHoDR4YjjJp34biM0mDvplBe//mB+IHCqHDGV7pxF+7MklTvighcCPPZC7ynWyjdTA==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      },
+      "funding": {
+        "url": "https://opencollective.com/eslint"
+      }
+    },
+    "node_modules/espree": {
+      "version": "11.2.0",
+      "resolved": "https://registry.npmjs.org/espree/-/espree-11.2.0.tgz",
+      "integrity": "sha512-7p3DrVEIopW1B1avAGLuCSh1jubc01H2JHc8B4qqGblmg5gI9yumBgACjWo4JlIc04ufug4xJ3SQI8HkS/Rgzw==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "acorn": "^8.16.0",
+        "acorn-jsx": "^5.3.2",
+        "eslint-visitor-keys": "^5.0.1"
+      },
+      "engines": {
+        "node": "^20.19.0 || ^22.13.0 || >=24"
+      },
+      "funding": {
+        "url": "https://opencollective.com/eslint"
+      }
+    },
+    "node_modules/esquery": {
+      "version": "1.7.0",
+      "resolved": "https://registry.npmjs.org/esquery/-/esquery-1.7.0.tgz",
+      "integrity": "sha512-Ap6G0WQwcU/LHsvLwON1fAQX9Zp0A2Y6Y/cJBl9r/JbW90Zyg4/zbG6zzKa2OTALELarYHmKu0GhpM5EO+7T0g==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "estraverse": "^5.1.0"
+      },
+      "engines": {
+        "node": ">=0.10"
+      }
+    },
+    "node_modules/esrecurse": {
+      "version": "4.3.0",
+      "resolved": "https://registry.npmjs.org/esrecurse/-/esrecurse-4.3.0.tgz",
+      "integrity": "sha512-KmfKL3b6G+RXvP8N1vr3Tq1kL/oCFgn2NYXEtqP8/L3pKapUA4G8cFVaoF3SU323CD4XypR/ffioHmkti6/Tag==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "estraverse": "^5.2.0"
+      },
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/estraverse": {
+      "version": "5.3.0",
+      "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.3.0.tgz",
+      "integrity": "sha512-MMdARuVEQziNTeJD8DgMqmhwR11BRQ/cBP+pLtYdSTnf3MIO8fFeiINEbX36ZdNlfU/7A9f3gUw49B3oQsvwBA==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=4.0"
+      }
+    },
+    "node_modules/estree-walker": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/estree-walker/-/estree-walker-3.0.3.tgz",
+      "integrity": "sha512-7RUKfXgSMMkzt6ZuXmqapOurLGPPfgj6l9uRZ7lRGolvk0y2yocc35LdcxKC5PQZdn2DMqioAQ2NoWcrTKmm6g==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@types/estree": "^1.0.0"
+      }
+    },
+    "node_modules/esutils": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmjs.org/esutils/-/esutils-2.0.3.tgz",
+      "integrity": "sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/expect-type": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/expect-type/-/expect-type-1.4.0.tgz",
+      "integrity": "sha512-KfYbmpRm0VbLjEvVa9yGwCi9GI34xvi7A/HXYWQO65CSD2u3MczUJSuwXKFIxlGsgBQizV9q5J9NHj4VG0n+pA==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=12.0.0"
+      }
+    },
+    "node_modules/fast-check": {
+      "version": "4.9.0",
+      "resolved": "https://registry.npmjs.org/fast-check/-/fast-check-4.9.0.tgz",
+      "integrity": "sha512-7ms6T7SybUev/PQITciI0yLM2pOSFy5zpG8Ty7tQofcVaQUvrMXp6CBwqF6fThLCLOrfBtuHAtwq6Yu4XPCllg==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "individual",
+          "url": "https://github.com/sponsors/dubzzz"
+        },
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/fast-check"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "pure-rand": "^8.0.0"
+      },
+      "engines": {
+        "node": ">=12.17.0"
+      }
+    },
+    "node_modules/fast-deep-equal": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.3.tgz",
+      "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/fast-json-stable-stringify": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/fast-json-stable-stringify/-/fast-json-stable-stringify-2.1.0.tgz",
+      "integrity": "sha512-lhd/wF+Lk98HZoTCtlVraHtfh5XYijIjalXck7saUtuanSDyLMxnHhSXEDJqHxD7msR8D0uCmqlkwjCV8xvwHw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/fast-levenshtein": {
+      "version": "2.0.6",
+      "resolved": "https://registry.npmjs.org/fast-levenshtein/-/fast-levenshtein-2.0.6.tgz",
+      "integrity": "sha512-DCXu6Ifhqcks7TZKY3Hxp3y6qphY5SJZmrWMDrKcERSOXWQdMhU9Ig/PYrzyw/ul9jOIyh0N4M0tbC5hodg8dw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/fdir": {
+      "version": "6.5.0",
+      "resolved": "https://registry.npmjs.org/fdir/-/fdir-6.5.0.tgz",
+      "integrity": "sha512-tIbYtZbucOs0BRGqPJkshJUYdL+SDH7dVM8gjy+ERp3WAUjLEFJE+02kanyHtwjWOnwrKYBiwAmM0p4kLJAnXg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=12.0.0"
+      },
+      "peerDependencies": {
+        "picomatch": "^3 || ^4"
+      },
+      "peerDependenciesMeta": {
+        "picomatch": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/file-entry-cache": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmjs.org/file-entry-cache/-/file-entry-cache-8.0.0.tgz",
+      "integrity": "sha512-XXTUwCvisa5oacNGRP9SfNtYBNAMi+RPwBFmblZEF7N7swHYQS6/Zfk7SRwx4D5j3CH211YNRco1DEMNVfZCnQ==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "flat-cache": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=16.0.0"
+      }
+    },
+    "node_modules/find-up": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/find-up/-/find-up-5.0.0.tgz",
+      "integrity": "sha512-78/PXT1wlLLDgTzDs7sjq9hzz0vXD+zn+7wypEe4fXQxCmdmqfGsEPQxmiCSQI3ajFV91bVSsvNtrJRiW6nGng==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "locate-path": "^6.0.0",
+        "path-exists": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/flat-cache": {
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/flat-cache/-/flat-cache-4.0.1.tgz",
+      "integrity": "sha512-f7ccFPK3SXFHpx15UIGyRJ/FJQctuKZ0zVuN3frBo4HnK3cay9VEW0R6yPYFHC0AgqhukPzKjq22t5DmAyqGyw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "flatted": "^3.2.9",
+        "keyv": "^4.5.4"
+      },
+      "engines": {
+        "node": ">=16"
+      }
+    },
+    "node_modules/flatted": {
+      "version": "3.4.3",
+      "resolved": "https://registry.npmjs.org/flatted/-/flatted-3.4.3.tgz",
+      "integrity": "sha512-/zipXxyO6rGvuNGDiULY9MvEGSkb2gaG4GGH4ygMi0ZZzyMHdUZBmntJmx5x1G2VuPytCwGN4xsJP6cw+sK+vQ==",
+      "dev": true,
+      "license": "ISC"
+    },
+    "node_modules/fsevents": {
+      "version": "2.3.2",
+      "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.3.2.tgz",
+      "integrity": "sha512-xiqMQR4xAeHTuB9uWm+fFRcIOgKBMiOBP+eXiyT7jsgVCq1bkVygt00oASowB7EdtpOHaaPgKt812P9ab+DDKA==",
+      "dev": true,
+      "hasInstallScript": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ],
+      "engines": {
+        "node": "^8.16.0 || ^10.6.0 || >=11.0.0"
+      }
+    },
+    "node_modules/glob-parent": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-6.0.2.tgz",
+      "integrity": "sha512-XxwI8EOhVQgWp6iDL+3b0r86f4d6AX6zSU55HfB4ydCEuXLXc5FcYeOu+nnGftS4TEju/11rt4KJPTMgbfmv4A==",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "is-glob": "^4.0.3"
+      },
+      "engines": {
+        "node": ">=10.13.0"
+      }
+    },
+    "node_modules/has-flag": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-4.0.0.tgz",
+      "integrity": "sha512-EykJT/Q1KjTWctppgIAgfSO0tKVuZUjhgMr17kqTumMl6Afv3EISleU7qZUzoXDFTAHTDC4NOoG/ZxU3EvlMPQ==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/html-escaper": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/html-escaper/-/html-escaper-2.0.2.tgz",
+      "integrity": "sha512-H2iMtd0I4Mt5eYiapRdIDjp+XzelXQ0tFE4JS7YFwFevXXMmOp9myNrUvCg0D6ws8iqkRPBfKHgbwig1SmlLfg==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/ignore": {
+      "version": "5.3.2",
+      "resolved": "https://registry.npmjs.org/ignore/-/ignore-5.3.2.tgz",
+      "integrity": "sha512-hsBTNUqQTDwkWtcdYI2i06Y/nUBEsNEDJKjWdigLvegy8kDuJAS8uRlpkkcQpyEXL0Z/pjDy5HBmMjRCJ2gq+g==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 4"
+      }
+    },
+    "node_modules/imurmurhash": {
+      "version": "0.1.4",
+      "resolved": "https://registry.npmjs.org/imurmurhash/-/imurmurhash-0.1.4.tgz",
+      "integrity": "sha512-JmXMZ6wuvDmLiHEml9ykzqO6lwFbof0GG4IkcGaENdCRDDmMVnny7s5HsIgHCbaq0w2MyPhDqkhTUgS2LU2PHA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.8.19"
+      }
+    },
+    "node_modules/is-extglob": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-2.1.1.tgz",
+      "integrity": "sha512-SbKbANkN603Vi4jEZv49LeVJMn4yGwsbzZworEoyEiutsN3nJYdbO36zfhGJ6QEDpOZIFkDtnq5JRxmvl3jsoQ==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/is-glob": {
+      "version": "4.0.3",
+      "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.3.tgz",
+      "integrity": "sha512-xelSayHH36ZgE7ZWhli7pW34hNbNl8Ojv5KVmkJD4hBdD3th8Tfk9vYasLM+mXWOZhFkgZfxhLSnrwRr4elSSg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "is-extglob": "^2.1.1"
+      },
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/isexe": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/isexe/-/isexe-2.0.0.tgz",
+      "integrity": "sha512-RHxMLp9lnKHGHRng9QFhRCMbYAcVpn69smSGcq3f36xjgVVWThj4qqLbTLlq7Ssj8B+fIQ1EuCEGI2lKsyQeIw==",
+      "dev": true,
+      "license": "ISC"
+    },
+    "node_modules/istanbul-lib-coverage": {
+      "version": "3.2.2",
+      "resolved": "https://registry.npmjs.org/istanbul-lib-coverage/-/istanbul-lib-coverage-3.2.2.tgz",
+      "integrity": "sha512-O8dpsF+r0WV/8MNRKfnmrtCWhuKjxrq2w+jpzBL5UZKTi2LeVWnWOmWRxFlesJONmc+wLAGvKQZEOanko0LFTg==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/istanbul-lib-report": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/istanbul-lib-report/-/istanbul-lib-report-3.0.1.tgz",
+      "integrity": "sha512-GCfE1mtsHGOELCU8e/Z7YWzpmybrx/+dSTfLrvY8qRmaY6zXTKWn6WQIjaAFw069icm6GVMNkgu0NzI4iPZUNw==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "istanbul-lib-coverage": "^3.0.0",
+        "make-dir": "^4.0.0",
+        "supports-color": "^7.1.0"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/istanbul-reports": {
+      "version": "3.2.0",
+      "resolved": "https://registry.npmjs.org/istanbul-reports/-/istanbul-reports-3.2.0.tgz",
+      "integrity": "sha512-HGYWWS/ehqTV3xN10i23tkPkpH46MLCIMFNCaaKNavAXTF1RkqxawEPtnjnGZ6XKSInBKkiOA5BKS+aZiY3AvA==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "html-escaper": "^2.0.0",
+        "istanbul-lib-report": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/js-tokens": {
+      "version": "10.0.0",
+      "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-10.0.0.tgz",
+      "integrity": "sha512-lM/UBzQmfJRo9ABXbPWemivdCW8V2G8FHaHdypQaIy523snUjog0W71ayWXTjiR+ixeMyVHN2XcpnTd/liPg/Q==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/json-buffer": {
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/json-buffer/-/json-buffer-3.0.1.tgz",
+      "integrity": "sha512-4bV5BfR2mqfQTJm+V5tPPdf+ZpuhiIvTuAB5g8kcrXOZpTT/QwwVRWBywX1ozr6lEuPdbHxwaJlm9G6mI2sfSQ==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/json-stable-stringify-without-jsonify": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/json-stable-stringify-without-jsonify/-/json-stable-stringify-without-jsonify-1.0.1.tgz",
+      "integrity": "sha512-Bdboy+l7tA3OGW6FjyFHWkP5LuByj1Tk33Ljyq0axyzdk9//JSi2u3fP1QSmd1KNwq6VOKYGlAu87CisVir6Pw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/keyv": {
+      "version": "4.5.4",
+      "resolved": "https://registry.npmjs.org/keyv/-/keyv-4.5.4.tgz",
+      "integrity": "sha512-oxVHkHR/EJf2CNXnWxRLW6mg7JyCCUcG0DtEGmL2ctUo1PNTin1PUil+r/+4r5MpVgC/fn1kjsx7mjSujKqIpw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "json-buffer": "3.0.1"
+      }
+    },
+    "node_modules/levn": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/levn/-/levn-0.4.1.tgz",
+      "integrity": "sha512-+bT2uH4E5LGE7h/n3evcS/sQlJXCpIp6ym8OWJ5eV6+67Dsql/LaaT7qJBAt2rzfoa/5QBGBhxDix1dMt2kQKQ==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "prelude-ls": "^1.2.1",
+        "type-check": "~0.4.0"
+      },
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/lightningcss": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss/-/lightningcss-1.33.0.tgz",
+      "integrity": "sha512-WkUDrojuJs0xkgGf2udWxa3yGBRxPtxUkB79i6aCZLRgc7PM8fZe9TosfPDcvEpQZbuFASnHYmRLBLUbmLOIIA==",
+      "dev": true,
+      "license": "MPL-2.0",
+      "dependencies": {
+        "detect-libc": "^2.0.3"
+      },
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      },
+      "optionalDependencies": {
+        "lightningcss-android-arm64": "1.33.0",
+        "lightningcss-darwin-arm64": "1.33.0",
+        "lightningcss-darwin-x64": "1.33.0",
+        "lightningcss-freebsd-x64": "1.33.0",
+        "lightningcss-linux-arm-gnueabihf": "1.33.0",
+        "lightningcss-linux-arm64-gnu": "1.33.0",
+        "lightningcss-linux-arm64-musl": "1.33.0",
+        "lightningcss-linux-x64-gnu": "1.33.0",
+        "lightningcss-linux-x64-musl": "1.33.0",
+        "lightningcss-win32-arm64-msvc": "1.33.0",
+        "lightningcss-win32-x64-msvc": "1.33.0"
+      }
+    },
+    "node_modules/lightningcss-android-arm64": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-android-arm64/-/lightningcss-android-arm64-1.33.0.tgz",
+      "integrity": "sha512-gEpRTalKdosp4Bb8qWtc2iOgE5SeIHlpS1up9bFq2wAyYhl1UdTObYiHe98zEM9SQvSoqQZ1IQD0JNpg3Ml5pg==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "android"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-darwin-arm64": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-darwin-arm64/-/lightningcss-darwin-arm64-1.33.0.tgz",
+      "integrity": "sha512-Sciaz8eenNTKn9b3t7+xr0ipTp9YxKQY4npwQ3mrRuL0BAVHBLyZxofhaKBAVtzmtRZ/zTyo0/to4B1uWG/Djg==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "darwin"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-darwin-x64": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-darwin-x64/-/lightningcss-darwin-x64-1.33.0.tgz",
+      "integrity": "sha512-Z5UPAxzrjlWNNyGy6i65cJzzvgJ5D3T6wMvs+gWpY9d7qRhANrxqAp6LhxIgZhWEw18RfJTGcRxjuLIBr+m8XQ==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "darwin"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-freebsd-x64": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-freebsd-x64/-/lightningcss-freebsd-x64-1.33.0.tgz",
+      "integrity": "sha512-QQM/Ti/hQajJwCY+RiWuCZ9sdtI/XQk7nDK5vC8kkdwixezOlDgvDx7+RT+QjK6FcFT4MpsuoBnHIo/O3StRRg==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "freebsd"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-linux-arm-gnueabihf": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-linux-arm-gnueabihf/-/lightningcss-linux-arm-gnueabihf-1.33.0.tgz",
+      "integrity": "sha512-N7FVBe6iS24MlM6R/4RBTxGhQheZGs7tiQ9U32UtF75NzP5Q7xWPRqLBCKxlRQRk3rY1jCIPLzx7WzOhuUIRLQ==",
+      "cpu": [
+        "arm"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-linux-arm64-gnu": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-linux-arm64-gnu/-/lightningcss-linux-arm64-gnu-1.33.0.tgz",
+      "integrity": "sha512-j2v/itmy4HlNxlc6voKXYgBqNi0Ng2LShg4z7GufpEgs05P+2suBVyi9I6YHq5uoVFx9ETin3eCEhLVyXGQnKg==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-linux-arm64-musl": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-linux-arm64-musl/-/lightningcss-linux-arm64-musl-1.33.0.tgz",
+      "integrity": "sha512-yiO5ROMuYQgXbC60yjZU5CYSFZGKXL0HFATXt9mHJn1+zW55oCtMI9NfcVhYLMFDL7gV7oBPon/EmMMGg2OvtQ==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-linux-x64-gnu": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-linux-x64-gnu/-/lightningcss-linux-x64-gnu-1.33.0.tgz",
+      "integrity": "sha512-ar+Ju7LmcN0Jo4FpL4hpFybwNG9/3A/Br5KW2n2jyODg3MEZXaDYADdemoNS+BDNfMgKvylJLj4S5tyRActuAg==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-linux-x64-musl": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-linux-x64-musl/-/lightningcss-linux-x64-musl-1.33.0.tgz",
+      "integrity": "sha512-RYiYbkokw0trfKqqzfF55lginwEPrD3OJDfTuJzFs1MK6iFnDenaz1fqLLtX4ITG3OktJQXOeTaw1awrBAlZPw==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "linux"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-win32-arm64-msvc": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-win32-arm64-msvc/-/lightningcss-win32-arm64-msvc-1.33.0.tgz",
+      "integrity": "sha512-1K+MPfLSFVpphzpdbfkhlWk6wBrTObBzS2T6db10PNOZgR9GoVsAWzwNyuhUYYbTp23j+4RrncfujZ4uAzXvwA==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "win32"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/lightningcss-win32-x64-msvc": {
+      "version": "1.33.0",
+      "resolved": "https://registry.npmjs.org/lightningcss-win32-x64-msvc/-/lightningcss-win32-x64-msvc-1.33.0.tgz",
+      "integrity": "sha512-OlEICDx/Xl0FqSp4bry8zFnCvGpig3Gl4gCquvYwHuqJKEC1+n9NgDniFvqHGmMv1ZkqDJrDqKKSykTDX+ehuA==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "license": "MPL-2.0",
+      "optional": true,
+      "os": [
+        "win32"
+      ],
+      "engines": {
+        "node": ">= 12.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/parcel"
+      }
+    },
+    "node_modules/locate-path": {
+      "version": "6.0.0",
+      "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-6.0.0.tgz",
+      "integrity": "sha512-iPZK6eYjbxRu3uB4/WZ3EsEIMJFMqAoopl3R+zuq0UjcAm/MO6KCweDgPfP3elTztoKP3KtnVHxTn2NHBSDVUw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "p-locate": "^5.0.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/magic-string": {
+      "version": "0.30.21",
+      "resolved": "https://registry.npmjs.org/magic-string/-/magic-string-0.30.21.tgz",
+      "integrity": "sha512-vd2F4YUyEXKGcLHoq+TEyCjxueSeHnFxyyjNp80yg0XV4vUhnDer/lvvlqM/arB5bXQN5K2/3oinyCRyx8T2CQ==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@jridgewell/sourcemap-codec": "^1.5.5"
+      }
+    },
+    "node_modules/magicast": {
+      "version": "0.5.3",
+      "resolved": "https://registry.npmjs.org/magicast/-/magicast-0.5.3.tgz",
+      "integrity": "sha512-pVKE4UdSQ7DvHzivsCIFx2BJn1mHG6KsyrFcaxFx6tONdneEuThrDx0Cj3AMg58KyN4pzYT+LHOotxDQDjNvkw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@babel/parser": "^7.29.3",
+        "@babel/types": "^7.29.0",
+        "source-map-js": "^1.2.1"
+      }
+    },
+    "node_modules/make-dir": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/make-dir/-/make-dir-4.0.0.tgz",
+      "integrity": "sha512-hXdUTZYIVOt1Ex//jAQi+wTZZpUpwBj/0QsOzqegb3rGMMeJiSEu5xLHnYfBrRV4RH2+OCSOO95Is/7x1WJ4bw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "semver": "^7.5.3"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/minimatch": {
+      "version": "10.2.6",
+      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-10.2.6.tgz",
+      "integrity": "sha512-vpLQEs+VLCr1nU0BXS07maYoFwlDAH0gngQuuttxIwutDFEMHq2blX+8vpgxDdK3J1PwjCJiep77OitTZ4Ll1A==",
+      "dev": true,
+      "license": "BlueOak-1.0.0",
+      "dependencies": {
+        "brace-expansion": "^5.0.8"
+      },
+      "engines": {
+        "node": "18 || 20 || >=22"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/isaacs"
+      }
+    },
+    "node_modules/ms": {
+      "version": "2.1.3",
+      "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz",
+      "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/nanoid": {
+      "version": "3.3.16",
+      "resolved": "https://registry.npmjs.org/nanoid/-/nanoid-3.3.16.tgz",
+      "integrity": "sha512-bzlKTyNJ7+LdGIIwy8ijFpIqEQIvafahV7eYykJ8Cvh42EdJeODoJ6gUJXpQJvej1BddH8OqTXZNE/KfbWAu8Q==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "bin": {
+        "nanoid": "bin/nanoid.cjs"
+      },
+      "engines": {
+        "node": "^10 || ^12 || ^13.7 || ^14 || >=15.0.1"
+      }
+    },
+    "node_modules/natural-compare": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/natural-compare/-/natural-compare-1.4.0.tgz",
+      "integrity": "sha512-OWND8ei3VtNC9h7V60qff3SVobHr996CTwgxubgyQYEpg290h9J0buyECNNJexkFm5sOajh5G116RYA1c8ZMSw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/obug": {
+      "version": "2.1.4",
+      "resolved": "https://registry.npmjs.org/obug/-/obug-2.1.4.tgz",
+      "integrity": "sha512-4a+OsYv9UktOJKE+l1A4OufDgdRF9PifWj+tJnHURo/P+WOxpG4GzUFL9qCalmWauao6ogiG+QvnCovwPoyAWA==",
+      "dev": true,
+      "funding": [
+        "https://github.com/sponsors/sxzz",
+        "https://opencollective.com/debug"
+      ],
+      "license": "MIT",
+      "engines": {
+        "node": ">=12.20.0"
+      }
+    },
+    "node_modules/optionator": {
+      "version": "0.9.4",
+      "resolved": "https://registry.npmjs.org/optionator/-/optionator-0.9.4.tgz",
+      "integrity": "sha512-6IpQ7mKUxRcZNLIObR0hz7lxsapSSIYNZJwXPGeF0mTVqGKFIXj1DQcMoT22S3ROcLyY/rz0PWaWZ9ayWmad9g==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "deep-is": "^0.1.3",
+        "fast-levenshtein": "^2.0.6",
+        "levn": "^0.4.1",
+        "prelude-ls": "^1.2.1",
+        "type-check": "^0.4.0",
+        "word-wrap": "^1.2.5"
+      },
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/p-limit": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/p-limit/-/p-limit-3.1.0.tgz",
+      "integrity": "sha512-TYOanM3wGwNGsZN2cVTYPArw454xnXj5qmWF1bEoAc4+cU/ol7GVh7odevjp1FNHduHc3KZMcFduxU5Xc6uJRQ==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "yocto-queue": "^0.1.0"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/p-locate": {
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/p-locate/-/p-locate-5.0.0.tgz",
+      "integrity": "sha512-LaNjtRWUBY++zB5nE/NwcaoMylSPk+S+ZHNB1TzdbMJMny6dynpAGt7X/tl/QYq3TIeE6nxHppbo2LGymrG5Pw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "p-limit": "^3.0.2"
+      },
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    },
+    "node_modules/path-exists": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/path-exists/-/path-exists-4.0.0.tgz",
+      "integrity": "sha512-ak9Qy5Q7jYb2Wwcey5Fpvg2KoAc/ZIhLSLOSBmRmygPsGwkVVt0fZa0qrtMz+m6tJTAHfZQ8FnmB4MG4LWy7/w==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/path-key": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/path-key/-/path-key-3.1.1.tgz",
+      "integrity": "sha512-ojmeN0qd+y0jszEtoY48r0Peq5dwMEkIlCOu6Q5f41lfkswXuKtYrhgoTpLnyIcHm24Uhqx+5Tqm2InSwLhE6Q==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/pathe": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmjs.org/pathe/-/pathe-2.0.3.tgz",
+      "integrity": "sha512-WUjGcAqP1gQacoQe+OBJsFA7Ld4DyXuUIjZ5cc75cLHvJ7dtNsTugphxIADwspS+AraAUePCKrSVtPLFj/F88w==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/picocolors": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.1.1.tgz",
+      "integrity": "sha512-xceH2snhtb5M9liqDsmEw56le376mTZkEX/jEb/RxNFyegNul7eNslCXP9FDj/Lcu0X8KEyMceP2ntpaHrDEVA==",
+      "dev": true,
+      "license": "ISC"
+    },
+    "node_modules/picomatch": {
+      "version": "4.0.5",
+      "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-4.0.5.tgz",
+      "integrity": "sha512-RvwwcruNjI1ncT5xRakeyS9Lf8lcItv34KD+aif+VH9kduAyfYBipGh12274xtenIPZ119/R9BdTBa8gAwSh0A==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/jonschlinkert"
+      }
+    },
+    "node_modules/playwright": {
+      "version": "1.62.0",
+      "resolved": "https://registry.npmjs.org/playwright/-/playwright-1.62.0.tgz",
+      "integrity": "sha512-Z14dG305dgaLu6foB1TXQagFiW8JfSUIUaUuPaKQ6NtBPKF1P/qXcqfh6c6K/icPqdy37JmjbiBXf6JNg6Sylw==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "dependencies": {
+        "playwright-core": "1.62.0"
+      },
+      "bin": {
+        "playwright": "cli.js"
+      },
+      "engines": {
+        "node": ">=20"
+      },
+      "optionalDependencies": {
+        "fsevents": "2.3.2"
+      }
+    },
+    "node_modules/playwright-core": {
+      "version": "1.62.0",
+      "resolved": "https://registry.npmjs.org/playwright-core/-/playwright-core-1.62.0.tgz",
+      "integrity": "sha512-nsNRyq0r2zsG8AcRHWknc9QRA5XCueC7gWMrs+Gx2tlZn9hcl8zudfh00lhJPY1DE7NmZ6bDsT9g2yey8mXljA==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "bin": {
+        "playwright-core": "cli.js"
+      },
+      "engines": {
+        "node": ">=20"
+      }
+    },
+    "node_modules/postcss": {
+      "version": "8.5.24",
+      "resolved": "https://registry.npmjs.org/postcss/-/postcss-8.5.24.tgz",
+      "integrity": "sha512-8RyVklq0owXUTa4xlpzu4l9AaVKIdQvAcOHZWaMh98HgySsUtxRVf/chRe3dsSLqb6i40BzGRzEUddRaI+9TSw==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/postcss/"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/postcss"
+        },
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "dependencies": {
+        "nanoid": "^3.3.16",
+        "picocolors": "^1.1.1",
+        "source-map-js": "^1.2.1"
+      },
+      "engines": {
+        "node": "^10 || ^12 || >=14"
+      }
+    },
+    "node_modules/prelude-ls": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/prelude-ls/-/prelude-ls-1.2.1.tgz",
+      "integrity": "sha512-vkcDPrRZo1QZLbn5RLGPpg/WmIQ65qoWWhcGKf/b5eplkkarX0m9z8ppCat4mlOqUsWpyNuYgO3VRyrYHSzX5g==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/prettier": {
+      "version": "3.9.6",
+      "resolved": "https://registry.npmjs.org/prettier/-/prettier-3.9.6.tgz",
+      "integrity": "sha512-OpN0zzVdiaiAhxpuuj5efpIS4sY9j7bY6uR5mnj5yPzGkdkjNKSJeUThPb60Jw29QuAZgA4o+/iB49kFiaBX6g==",
+      "dev": true,
+      "license": "MIT",
+      "bin": {
+        "prettier": "bin/prettier.cjs"
+      },
+      "engines": {
+        "node": ">=14"
+      },
+      "funding": {
+        "url": "https://github.com/prettier/prettier?sponsor=1"
+      }
+    },
+    "node_modules/punycode": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmjs.org/punycode/-/punycode-2.3.1.tgz",
+      "integrity": "sha512-vYt7UD1U9Wg6138shLtLOvdAu+8DsC/ilFtEVHcH+wydcSpNE20AfSOduf6MkRFahL5FY7X1oU7nKVZFtfq8Fg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
+    "node_modules/pure-rand": {
+      "version": "8.4.2",
+      "resolved": "https://registry.npmjs.org/pure-rand/-/pure-rand-8.4.2.tgz",
+      "integrity": "sha512-vvuOGgcuPJAirlHvuQw1TrOiw7ptaIXXmIbNuiNOY6lNGJJH49PQ1Kj4nd783nPdQhQdicgOjVI2yI/9BD6/Ng==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "individual",
+          "url": "https://github.com/sponsors/dubzzz"
+        },
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/fast-check"
+        }
+      ],
+      "license": "MIT"
+    },
+    "node_modules/rolldown": {
+      "version": "1.1.5",
+      "resolved": "https://registry.npmjs.org/rolldown/-/rolldown-1.1.5.tgz",
+      "integrity": "sha512-t9z29cJjXf/vxQ8dyhCSpt6H6aSwHTk8cT5I3iy6SMXuFpk5mB6PL6XfC8PCwrPTx93udwKUm9HRteAlTGBLiA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@oxc-project/types": "=0.139.0",
+        "@rolldown/pluginutils": "^1.0.0"
+      },
+      "bin": {
+        "rolldown": "bin/cli.mjs"
+      },
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      },
+      "optionalDependencies": {
+        "@rolldown/binding-android-arm64": "1.1.5",
+        "@rolldown/binding-darwin-arm64": "1.1.5",
+        "@rolldown/binding-darwin-x64": "1.1.5",
+        "@rolldown/binding-freebsd-x64": "1.1.5",
+        "@rolldown/binding-linux-arm-gnueabihf": "1.1.5",
+        "@rolldown/binding-linux-arm64-gnu": "1.1.5",
+        "@rolldown/binding-linux-arm64-musl": "1.1.5",
+        "@rolldown/binding-linux-ppc64-gnu": "1.1.5",
+        "@rolldown/binding-linux-s390x-gnu": "1.1.5",
+        "@rolldown/binding-linux-x64-gnu": "1.1.5",
+        "@rolldown/binding-linux-x64-musl": "1.1.5",
+        "@rolldown/binding-openharmony-arm64": "1.1.5",
+        "@rolldown/binding-wasm32-wasi": "1.1.5",
+        "@rolldown/binding-win32-arm64-msvc": "1.1.5",
+        "@rolldown/binding-win32-x64-msvc": "1.1.5"
+      }
+    },
+    "node_modules/semver": {
+      "version": "7.8.5",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-7.8.5.tgz",
+      "integrity": "sha512-Y7/KDsb8LjooZpwaqGyulO6DQlksgCncchHGk+sZIY4SBvUocMBEFH5Ur1fI4dV+Jvl0w6cjvucaIi40puRioA==",
+      "dev": true,
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/shebang-command": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/shebang-command/-/shebang-command-2.0.0.tgz",
+      "integrity": "sha512-kHxr2zZpYtdmrN1qDjrrX/Z1rR1kG8Dx+gkpK1G4eXmvXswmcE1hTWBWYUzlraYw1/yZp6YuDY77YtvbN0dmDA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "shebang-regex": "^3.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/shebang-regex": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/shebang-regex/-/shebang-regex-3.0.0.tgz",
+      "integrity": "sha512-7++dFhtcx3353uBaq8DDR4NuxBetBzC7ZQOhmTQInHEd6bSrXdiEyzCvG07Z44UYdLShWUyXt5M/yhz8ekcb1A==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/siginfo": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/siginfo/-/siginfo-2.0.0.tgz",
+      "integrity": "sha512-ybx0WO1/8bSBLEWXZvEd7gMW3Sn3JFlW3TvX1nREbDLRNQNaeNN8WK0meBwPdAaOI7TtRRRJn/Es1zhrrCHu7g==",
+      "dev": true,
+      "license": "ISC"
+    },
+    "node_modules/source-map-js": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/source-map-js/-/source-map-js-1.2.1.tgz",
+      "integrity": "sha512-UXWMKhLOwVKb728IUtQPXxfYU+usdybtUrK/8uGE8CQMvrhOpwvzDBwj0QhSL7MQc7vIsISBG8VQ8+IDQxpfQA==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/stackback": {
+      "version": "0.0.2",
+      "resolved": "https://registry.npmjs.org/stackback/-/stackback-0.0.2.tgz",
+      "integrity": "sha512-1XMJE5fQo1jGH6Y/7ebnwPOBEkIEnT4QF32d5R1+VXdXveM0IBMJt8zfaxX1P3QhVwrYe+576+jkANtSS2mBbw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/std-env": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/std-env/-/std-env-4.2.0.tgz",
+      "integrity": "sha512-oCUKSupKTHX53EyjDtuZQ64pjLJ6yYCtpmEw0goYxtjG9KpbRe8KAsl2tBUGU9DyMcJ0RwJ8GqJAFzMXcXW1Rw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/supports-color": {
+      "version": "7.2.0",
+      "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-7.2.0.tgz",
+      "integrity": "sha512-qpCAvRl9stuOHveKsn7HncJRvv501qIacKzQlO/+Lwxc9+0q2wLyv4Dfvt80/DPn2pqOBsJdDiogXGR9+OvwRw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "has-flag": "^4.0.0"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/tinybench": {
+      "version": "2.9.0",
+      "resolved": "https://registry.npmjs.org/tinybench/-/tinybench-2.9.0.tgz",
+      "integrity": "sha512-0+DUvqWMValLmha6lr4kD8iAMK1HzV0/aKnCtWb9v9641TnP/MFb7Pc2bxoxQjTXAErryXVgUOfv2YqNllqGeg==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/tinyexec": {
+      "version": "1.2.4",
+      "resolved": "https://registry.npmjs.org/tinyexec/-/tinyexec-1.2.4.tgz",
+      "integrity": "sha512-SHf/r48b7vOrjve9PxJo3MN5v5yuyjHvdUcrQffT3WXMUfnGmHDVbC4k3sHJaJTgZCwpUplIaAo5ANtMyp3YHg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=18"
+      }
+    },
+    "node_modules/tinyglobby": {
+      "version": "0.2.17",
+      "resolved": "https://registry.npmjs.org/tinyglobby/-/tinyglobby-0.2.17.tgz",
+      "integrity": "sha512-wXR/dYpcqKmfWpEdZjiKJOwCNFndD0DMnrW/cYjVGttEkBfVgcLFHoNrlj47mjOVic9yyNu65alsgF4NQyTa2g==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "fdir": "^6.5.0",
+        "picomatch": "^4.0.4"
+      },
+      "engines": {
+        "node": ">=12.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/SuperchupuDev"
+      }
+    },
+    "node_modules/tinyrainbow": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/tinyrainbow/-/tinyrainbow-3.1.1.tgz",
+      "integrity": "sha512-yau8yJdTt989Mm0Bd/236QnzEiPf2xLLTqUZRUJOo/3CB078LSwzei343DgtJVmfJKJE3TMINY1u42SQsP6mXw==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=14.0.0"
+      }
+    },
+    "node_modules/ts-api-utils": {
+      "version": "2.5.0",
+      "resolved": "https://registry.npmjs.org/ts-api-utils/-/ts-api-utils-2.5.0.tgz",
+      "integrity": "sha512-OJ/ibxhPlqrMM0UiNHJ/0CKQkoKF243/AEmplt3qpRgkW8VG7IfOS41h7V8TjITqdByHzrjcS/2si+y4lIh8NA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=18.12"
+      },
+      "peerDependencies": {
+        "typescript": ">=4.8.4"
+      }
+    },
+    "node_modules/tslib": {
+      "version": "2.8.1",
+      "resolved": "https://registry.npmjs.org/tslib/-/tslib-2.8.1.tgz",
+      "integrity": "sha512-oJFu94HQb+KVduSUQL7wnpmqnfmLsOA/nAh6b6EH0wCEoK0/mPeXU6c3wKDV83MkOuHPRHtSXKKU99IBazS/2w==",
+      "dev": true,
+      "license": "0BSD"
+    },
+    "node_modules/type-check": {
+      "version": "0.4.0",
+      "resolved": "https://registry.npmjs.org/type-check/-/type-check-0.4.0.tgz",
+      "integrity": "sha512-XleUoc9uwGXqjWwXaUTZAmzMcFZ5858QA2vvx1Ur5xIcixXIP+8LnFDgRplU30us6teqdlskFfu+ae4K79Ooew==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "prelude-ls": "^1.2.1"
+      },
+      "engines": {
+        "node": ">= 0.8.0"
+      }
+    },
+    "node_modules/typescript": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/typescript/-/typescript-6.0.3.tgz",
+      "integrity": "sha512-y2TvuxSZPDyQakkFRPZHKFm+KKVqIisdg9/CZwm9ftvKXLP8NRWj38/ODjNbr43SsoXqNuAisEf1GdCxqWcdBw==",
+      "dev": true,
+      "license": "Apache-2.0",
+      "peer": true,
+      "bin": {
+        "tsc": "bin/tsc",
+        "tsserver": "bin/tsserver"
+      },
+      "engines": {
+        "node": ">=14.17"
+      }
+    },
+    "node_modules/typescript-eslint": {
+      "version": "8.65.0",
+      "resolved": "https://registry.npmjs.org/typescript-eslint/-/typescript-eslint-8.65.0.tgz",
+      "integrity": "sha512-/ggrHAwyjENDusvyxbuqxAC2dTnZg/Z8F+fgQtYIz+L6n/9HfSlEZcFGV/NsMNa6CkGk0xUjUAFwC0vHOflvIA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@typescript-eslint/eslint-plugin": "8.65.0",
+        "@typescript-eslint/parser": "8.65.0",
+        "@typescript-eslint/typescript-estree": "8.65.0",
+        "@typescript-eslint/utils": "8.65.0"
+      },
+      "engines": {
+        "node": "^18.18.0 || ^20.9.0 || >=21.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/typescript-eslint"
+      },
+      "peerDependencies": {
+        "eslint": "^8.57.0 || ^9.0.0 || ^10.0.0",
+        "typescript": ">=4.8.4 <6.1.0"
+      }
+    },
+    "node_modules/undici-types": {
+      "version": "8.3.0",
+      "resolved": "https://registry.npmjs.org/undici-types/-/undici-types-8.3.0.tgz",
+      "integrity": "sha512-j375ScV60dom+YkPFIfTLcOiPxkN/buHz5GobjLhixFuANaNs3C9l4GmrWqejgXWJ7BbJcFYpTEUkS1Ge8bpZQ==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/uri-js": {
+      "version": "4.4.1",
+      "resolved": "https://registry.npmjs.org/uri-js/-/uri-js-4.4.1.tgz",
+      "integrity": "sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "punycode": "^2.1.0"
+      }
+    },
+    "node_modules/vite": {
+      "version": "8.1.5",
+      "resolved": "https://registry.npmjs.org/vite/-/vite-8.1.5.tgz",
+      "integrity": "sha512-7ULLwsCdYx/nRyrpiEwvqb5TFHrMVZyBt+rg/OAXT7rgj/z+DtTDyKFeLAdDkubDVDKD8jOsndmy7m55XcfUsw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "lightningcss": "^1.32.0",
+        "picomatch": "^4.0.5",
+        "postcss": "^8.5.17",
+        "rolldown": "~1.1.5",
+        "tinyglobby": "^0.2.17"
+      },
+      "bin": {
+        "vite": "bin/vite.js"
+      },
+      "engines": {
+        "node": "^20.19.0 || >=22.12.0"
+      },
+      "funding": {
+        "url": "https://github.com/vitejs/vite?sponsor=1"
+      },
+      "optionalDependencies": {
+        "fsevents": "~2.3.3"
+      },
+      "peerDependencies": {
+        "@types/node": "^20.19.0 || >=22.12.0",
+        "@vitejs/devtools": "^0.3.0",
+        "esbuild": "^0.27.0 || ^0.28.0",
+        "jiti": ">=1.21.0",
+        "less": "^4.0.0",
+        "sass": "^1.70.0",
+        "sass-embedded": "^1.70.0",
+        "stylus": ">=0.54.8",
+        "sugarss": "^5.0.0",
+        "terser": "^5.16.0",
+        "tsx": "^4.8.1",
+        "yaml": "^2.4.2"
+      },
+      "peerDependenciesMeta": {
+        "@types/node": {
+          "optional": true
+        },
+        "@vitejs/devtools": {
+          "optional": true
+        },
+        "esbuild": {
+          "optional": true
+        },
+        "jiti": {
+          "optional": true
+        },
+        "less": {
+          "optional": true
+        },
+        "sass": {
+          "optional": true
+        },
+        "sass-embedded": {
+          "optional": true
+        },
+        "stylus": {
+          "optional": true
+        },
+        "sugarss": {
+          "optional": true
+        },
+        "terser": {
+          "optional": true
+        },
+        "tsx": {
+          "optional": true
+        },
+        "yaml": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/vite/node_modules/fsevents": {
+      "version": "2.3.3",
+      "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.3.3.tgz",
+      "integrity": "sha512-5xoDfX+fL7faATnagmWPpbFtwh/R77WmMMqqHGS65C3vvB0YHrgF+B1YmZ3441tMj5n63k0212XNoJwzlhffQw==",
+      "dev": true,
+      "hasInstallScript": true,
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ],
+      "engines": {
+        "node": "^8.16.0 || ^10.6.0 || >=11.0.0"
+      }
+    },
+    "node_modules/vitest": {
+      "version": "4.1.10",
+      "resolved": "https://registry.npmjs.org/vitest/-/vitest-4.1.10.tgz",
+      "integrity": "sha512-R9jUTe5S4Qb0HCd4TNqpC7oGcrMssMRGXLW80ubjWsW9VH5GF8y1Y0SFLY9AbqSk6nt0PnOx4H4WNJYZ13GUPw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@vitest/expect": "4.1.10",
+        "@vitest/mocker": "4.1.10",
+        "@vitest/pretty-format": "4.1.10",
+        "@vitest/runner": "4.1.10",
+        "@vitest/snapshot": "4.1.10",
+        "@vitest/spy": "4.1.10",
+        "@vitest/utils": "4.1.10",
+        "es-module-lexer": "^2.0.0",
+        "expect-type": "^1.3.0",
+        "magic-string": "^0.30.21",
+        "obug": "^2.1.1",
+        "pathe": "^2.0.3",
+        "picomatch": "^4.0.3",
+        "std-env": "^4.0.0-rc.1",
+        "tinybench": "^2.9.0",
+        "tinyexec": "^1.0.2",
+        "tinyglobby": "^0.2.15",
+        "tinyrainbow": "^3.1.0",
+        "vite": "^6.0.0 || ^7.0.0 || ^8.0.0",
+        "why-is-node-running": "^2.3.0"
+      },
+      "bin": {
+        "vitest": "vitest.mjs"
+      },
+      "engines": {
+        "node": "^20.0.0 || ^22.0.0 || >=24.0.0"
+      },
+      "funding": {
+        "url": "https://opencollective.com/vitest"
+      },
+      "peerDependencies": {
+        "@edge-runtime/vm": "*",
+        "@opentelemetry/api": "^1.9.0",
+        "@types/node": "^20.0.0 || ^22.0.0 || >=24.0.0",
+        "@vitest/browser-playwright": "4.1.10",
+        "@vitest/browser-preview": "4.1.10",
+        "@vitest/browser-webdriverio": "4.1.10",
+        "@vitest/coverage-istanbul": "4.1.10",
+        "@vitest/coverage-v8": "4.1.10",
+        "@vitest/ui": "4.1.10",
+        "happy-dom": "*",
+        "jsdom": "*",
+        "vite": "^6.0.0 || ^7.0.0 || ^8.0.0"
+      },
+      "peerDependenciesMeta": {
+        "@edge-runtime/vm": {
+          "optional": true
+        },
+        "@opentelemetry/api": {
+          "optional": true
+        },
+        "@types/node": {
+          "optional": true
+        },
+        "@vitest/browser-playwright": {
+          "optional": true
+        },
+        "@vitest/browser-preview": {
+          "optional": true
+        },
+        "@vitest/browser-webdriverio": {
+          "optional": true
+        },
+        "@vitest/coverage-istanbul": {
+          "optional": true
+        },
+        "@vitest/coverage-v8": {
+          "optional": true
+        },
+        "@vitest/ui": {
+          "optional": true
+        },
+        "happy-dom": {
+          "optional": true
+        },
+        "jsdom": {
+          "optional": true
+        },
+        "vite": {
+          "optional": false
+        }
+      }
+    },
+    "node_modules/which": {
+      "version": "2.0.2",
+      "resolved": "https://registry.npmjs.org/which/-/which-2.0.2.tgz",
+      "integrity": "sha512-BLI3Tl1TW3Pvl70l3yq3Y64i+awpwXqsGBYWkkqMtnbXgrMD+yj7rhW0kuEDxzJaYXGjEW5ogapKNMEKNMjibA==",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "isexe": "^2.0.0"
+      },
+      "bin": {
+        "node-which": "bin/node-which"
+      },
+      "engines": {
+        "node": ">= 8"
+      }
+    },
+    "node_modules/why-is-node-running": {
+      "version": "2.3.0",
+      "resolved": "https://registry.npmjs.org/why-is-node-running/-/why-is-node-running-2.3.0.tgz",
+      "integrity": "sha512-hUrmaWBdVDcxvYqnyh09zunKzROWjbZTiNy8dBEjkS7ehEDQibXJ7XvlmtbwuTclUiIyN+CyXQD4Vmko8fNm8w==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "siginfo": "^2.0.0",
+        "stackback": "0.0.2"
+      },
+      "bin": {
+        "why-is-node-running": "cli.js"
+      },
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/word-wrap": {
+      "version": "1.2.5",
+      "resolved": "https://registry.npmjs.org/word-wrap/-/word-wrap-1.2.5.tgz",
+      "integrity": "sha512-BN22B5eaMMI9UMtjrGd5g5eCYPpCPDUy0FJXbYsaT5zYxjFOckS53SQDE3pWkVoWpHXVb3BrYcEN4Twa55B5cA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/yocto-queue": {
+      "version": "0.1.0",
+      "resolved": "https://registry.npmjs.org/yocto-queue/-/yocto-queue-0.1.0.tgz",
+      "integrity": "sha512-rVksvsnNCdJ/ohGc6xgPwyN8eheCxsiLM8mxuE/t/mOVqJewPuO1miLpTHQiRgTKCLexL4MeAFVagts7HmNZ2Q==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=10"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/sindresorhus"
+      }
+    }
+  }
+}
diff --git a/package.json b/package.json
new file mode 100644
index 0000000..e23f9c1
--- /dev/null
+++ b/package.json
@@ -0,0 +1,39 @@
+{
+  "name": "boolean-function-minimizer",
+  "version": "2.0.0",
+  "private": true,
+  "type": "module",
+  "engines": {
+    "node": ">=24",
+    "npm": ">=11"
+  },
+  "scripts": {
+    "dev": "vite",
+    "build": "tsc -b && vite build",
+    "preview": "vite preview",
+    "lint": "eslint .",
+    "format:check": "prettier --check .",
+    "format": "prettier --write .",
+    "typecheck": "tsc -b --pretty false",
+    "test": "vitest run",
+    "test:coverage": "vitest run --coverage",
+    "test:e2e": "playwright test",
+    "capture:preview": "node scripts/capture-preview.mjs",
+    "check": "npm run format:check && npm run lint && npm run typecheck && npm test && npm run build"
+  },
+  "devDependencies": {
+    "@emnapi/core": "^2.0.0-alpha.3",
+    "@emnapi/runtime": "^2.0.0-alpha.3",
+    "@eslint/js": "^10.0.1",
+    "@playwright/test": "^1.62.0",
+    "@types/node": "^26.1.2",
+    "@vitest/coverage-v8": "^4.1.10",
+    "eslint": "^10.8.0",
+    "fast-check": "^4.9.0",
+    "prettier": "^3.9.6",
+    "typescript": "^6.0.3",
+    "typescript-eslint": "^8.65.0",
+    "vite": "^8.1.5",
+    "vitest": "^4.1.10"
+  }
+}
diff --git a/patrick-method-core.js b/patrick-method-core.js
deleted file mode 100644
index 4f8c729..0000000
--- a/patrick-method-core.js
+++ /dev/null
@@ -1,2481 +0,0 @@
-/**
- * Patrick Method 核心演算法實現
- * 支援單輸出和多輸出邏輯最小化
- * 
- * 主要功能：
- * 1. Quine-McCluskey 演算法生成 Prime Implicants
- * 2. Patrick Method 求解最小覆蓋
- * 3. 多輸出函數共享最佳化
- * 4. 三階段成本計算系統
- */
-
-class PatrickMethod {
-    constructor() {
-        // 邏輯變數陣列
-        this.variables = [];
-        // Prime Implicants 清單
-        this.primeImplicants = [];
-        // Minterms 清單
-        this.minterms = [];
-        // Don't Care 項目清單
-        this.dontCares = [];
-        // 覆蓋表 (Coverage Table)
-        this.coverageTable = {};
-        // 必要 Prime Implicants (Essential PIs)
-        this.essentialPIs = [];
-        // 計算步驟記錄
-        this.calculationSteps = [];
-        // 共享項目清單
-        this.sharedTerms = [];
-    }
-
-    /**
-     * 解析變數字串
-     * @param {string} variableStr - 變數字串，可用逗號分隔或連續字元
-     * @returns {Array} 解析後的變數陣列
-     */
-    parseVariables(variableStr) {
-        if (variableStr.includes(',')) {
-            // 逗號分隔格式：x,y,z
-            this.variables = variableStr.split(',').map(v => v.trim());
-        } else {
-            // 連續字元格式：xyz
-            this.variables = variableStr.split('').map(v => v.trim());
-        }
-        return this.variables;
-    }
-
-    /**
-     * 解析 Prime Implicants 字串
-     * @param {string} piStr - PI 字串，支援多種格式
-     * @returns {Array} 解析後的 PI 陣列
-     */
-    parsePrimeImplicants(piStr) {
-        this.primeImplicants = [];
-        const lines = piStr.split('\n').filter(line => line.trim());
-        
-        lines.forEach(line => {
-            const trimmedLine = line.trim();
-            if (trimmedLine.includes(':')) {
-                // 處理 "名稱: 模式" 格式
-                const [name, pattern] = trimmedLine.split(':').map(part => part.trim());
-                // 移除可能的空格和非法符號，只保留 0、1、-
-                const cleanPattern = pattern.replace(/[^01-]/g, '');
-                if (cleanPattern.length > 0) {
-                    this.primeImplicants.push({
-                        name: name,
-                        pattern: cleanPattern,
-                        minterms: this.convertPatternToMinterms(cleanPattern)
-                    });
-                }
-            } else if (trimmedLine.match(/^[01-]+$/)) {
-                // 處理直接的 pattern 格式（如：01-、-11）
-                const cleanPattern = trimmedLine.replace(/[^01-]/g, '');
-                if (cleanPattern.length > 0) {
-                    this.primeImplicants.push({
-                        name: `P${this.primeImplicants.length + 1}`,
-                        pattern: cleanPattern,
-                        minterms: this.convertPatternToMinterms(cleanPattern)
-                    });
-                }
-            }
-        });
-        
-        return this.primeImplicants;
-    }
-
-    /**
-     * 只生成真正的 Prime Implicants（單函數模式專用）
-     * 使用 Quine-McCluskey 演算法，只收集迭代合成後的最終產物
-     * 不包含中間層級的 implicants，確保結果為真正的 Prime Implicants
-     * 
-     * @param {Array} minterms - 目標 minterms 陣列
-     * @param {number} numVars - 變數數量
-     * @param {Array} dontCares - Don't Care 項目陣列
-     * @returns {Array} 真正的 Prime Implicants 陣列
-     */
-    generateOnlyTruePrimeImplicants(minterms, numVars, dontCares = []) {
-        console.log(`單函數模式生成真正的Prime Implicants: minterms=[${minterms.join(',')}], numVars=${numVars}`);
-        
-        // 合併 minterms 和 don't cares，建立完整的項目集合
-        const allTerms = [...minterms, ...dontCares].map(term => parseInt(term, 10));
-        const uniqueTerms = [...new Set(allTerms)].filter(term => !isNaN(term));
-        
-        // 轉換為二進制表示，作為第 0 層（初始層）
-        let currentLevel = uniqueTerms.map(term => {
-            const binary = term.toString(2).padStart(numVars, '0');
-            return {
-                binary: binary,
-                minterms: [term],
-                level: 0
-            };
-        });
-        
-        const allImplicants = [];
-        let levelNumber = 0;
-        
-        // 逐層生成更高級的 implicants
-        while (currentLevel.length > 0) {
-            const nextLevel = [];
-            const usedIndices = new Set();
-            
-            // 按二進制中1的數量分組
-            const groups = {};
-            currentLevel.forEach((term, index) => {
-                const ones = (term.binary.match(/1/g) || []).length;
-                if (!groups[ones]) groups[ones] = [];
-                groups[ones].push({...term, index});
-            });
-            
-            // 嘗試組合相鄰組
-            const groupKeys = Object.keys(groups).map(k => parseInt(k)).sort((a, b) => a - b);
-            for (let i = 0; i < groupKeys.length - 1; i++) {
-                const group1 = groups[groupKeys[i]];
-                const group2 = groups[groupKeys[i + 1]];
-                
-                group1.forEach(term1 => {
-                    group2.forEach(term2 => {
-                        const combined = this.combineBinaryTerms(term1.binary, term2.binary);
-                        if (combined) {
-                            // 檢查是否已存在相同的組合
-                            const existingTerm = nextLevel.find(t => t.binary === combined);
-                            if (!existingTerm) {
-                                nextLevel.push({
-                                    binary: combined,
-                                    minterms: [...new Set([...term1.minterms, ...term2.minterms])].sort((a, b) => a - b),
-                                    level: levelNumber + 1
-                                });
-                            }
-                            
-                            usedIndices.add(term1.index);
-                            usedIndices.add(term2.index);
-                        }
-                    });
-                });
-            }
-            
-            // 將無法再合成的項目加入到最終結果 (這些就是Prime Implicants)
-            currentLevel.forEach((term, index) => {
-                if (!usedIndices.has(index)) {
-                    allImplicants.push(term);
-                }
-            });
-            
-            // 如果沒有下一層，迭代結束
-            if (nextLevel.length === 0) {
-                break;
-            }
-            
-            currentLevel = nextLevel;
-            levelNumber++;
-        }
-        
-        // 最後一層的所有項目都是Prime Implicants
-        // 注意：這些項目在迭代過程中已經被添加到allImplicants中了（作為無法再合成的項目）
-        // 所以不需要重複添加
-        // allImplicants.push(...currentLevel); // 移除這行避免重複
-        
-        // 過濾出只包含實際minterms的Prime Implicants，並去重
-        const truePrimeImplicants = [];
-        const seenPatterns = new Set();
-        
-        allImplicants.forEach(implicant => {
-            const coveredMinterms = implicant.minterms.filter(m => minterms.includes(m));
-            if (coveredMinterms.length > 0 && !seenPatterns.has(implicant.binary)) {
-                seenPatterns.add(implicant.binary);
-                truePrimeImplicants.push({
-                    pattern: implicant.binary,
-                    minterms: coveredMinterms
-                });
-            }
-        });
-        
-        console.log(`生成了 ${truePrimeImplicants.length} 個真正的Prime Implicants`);
-        console.log(`所有生成的implicants (${allImplicants.length}個):`, allImplicants.map(i => `${i.binary}:[${i.minterms.join(',')}]`));
-        truePrimeImplicants.forEach((pi, index) => {
-            console.log(`PI${index+1}: ${pi.pattern} → 覆蓋 m${pi.minterms.join(',m')}`);
-        });
-        
-        return truePrimeImplicants;
-    }
-
-    /**
-     * 為單函數生成真正的 Prime Implicants（舊版本方法，保留備用）
-     */
-    generateTruePrimeImplicantsForSingleFunction(minterms, numVars, dontCares = []) {
-        console.log(`單函數模式生成 Prime Implicants: minterms=[${minterms.join(',')}], numVars=${numVars}`);
-        
-        // 合併 minterms 和 don't cares
-        const allTerms = [...minterms, ...dontCares].map(term => parseInt(term, 10));
-        const uniqueTerms = [...new Set(allTerms)].filter(term => !isNaN(term));
-        
-        // 轉換為二進制表示，作為第0層
-        let currentLevel = uniqueTerms.map(term => {
-            const binary = term.toString(2).padStart(numVars, '0');
-            return {
-                binary: binary,
-                minterms: [term],
-                level: 0
-            };
-        });
-        
-        const allImplicants = [...currentLevel];
-        let levelNumber = 0;
-        
-        // 逐層生成更高級的 implicants
-        while (currentLevel.length > 1) {
-            const nextLevel = [];
-            const usedIndices = new Set();
-            
-            // 按二進制中1的數量分組
-            const groups = {};
-            currentLevel.forEach((term, index) => {
-                const ones = (term.binary.match(/1/g) || []).length;
-                if (!groups[ones]) groups[ones] = [];
-                groups[ones].push({...term, index});
-            });
-            
-            // 嘗試組合相鄰組
-            const groupKeys = Object.keys(groups).map(k => parseInt(k)).sort((a, b) => a - b);
-            for (let i = 0; i < groupKeys.length - 1; i++) {
-                const group1 = groups[groupKeys[i]];
-                const group2 = groups[groupKeys[i + 1]];
-                
-                group1.forEach(term1 => {
-                    group2.forEach(term2 => {
-                        const combined = this.combineBinaryTerms(term1.binary, term2.binary);
-                        if (combined) {
-                            // 檢查是否已存在相同的組合
-                            const existingTerm = nextLevel.find(t => t.binary === combined);
-                            if (!existingTerm) {
-                                nextLevel.push({
-                                    binary: combined,
-                                    minterms: [...new Set([...term1.minterms, ...term2.minterms])].sort((a, b) => a - b),
-                                    level: levelNumber + 1
-                                });
-                            }
-                            
-                            usedIndices.add(term1.index);
-                            usedIndices.add(term2.index);
-                        }
-                    });
-                });
-            }
-            
-            if (nextLevel.length === 0) break;
-            
-            allImplicants.push(...nextLevel);
-            currentLevel = nextLevel;
-            levelNumber++;
-        }
-        
-        // 找到真正的 Prime Implicants
-        const truePrimeImplicants = [];
-        
-        allImplicants.forEach(implicant => {
-            let isPrime = true;
-            
-            // 檢查是否被其他更通用的 implicant 包含
-            for (let other of allImplicants) {
-                if (other !== implicant && this.isMoreGeneral(other.binary, implicant.binary)) {
-                    // 檢查是否覆蓋相同的 minterms
-                    const implicantMintermsInOriginal = implicant.minterms.filter(m => minterms.includes(m));
-                    const otherMintermsInOriginal = other.minterms.filter(m => minterms.includes(m));
-                    
-                    if (otherMintermsInOriginal.length > 0 && 
-                        implicantMintermsInOriginal.every(m => otherMintermsInOriginal.includes(m))) {
-                        isPrime = false;
-                        break;
-                    }
-                }
-            }
-            
-            if (isPrime) {
-                const coveredMinterms = implicant.minterms.filter(m => minterms.includes(m));
-                if (coveredMinterms.length > 0) {
-                    truePrimeImplicants.push({
-                        pattern: implicant.binary,
-                        minterms: coveredMinterms
-                    });
-                }
-            }
-        });
-        
-        console.log(`生成了 ${truePrimeImplicants.length} 個 Prime Implicants`);
-        truePrimeImplicants.forEach((pi, index) => {
-            console.log(`PI${index+1}: ${pi.pattern} → 覆蓋 m${pi.minterms.join(',m')}`);
-        });
-        
-        return truePrimeImplicants;
-    }
-
-    /**
-     * 將pattern轉換為minterms
-     */
-    convertPatternToMinterms(pattern) {
-        const minterms = [];
-        const numVars = pattern.length;
-        
-        // 計算所有可能的組合
-        const dontCarePositions = [];
-        for (let i = 0; i < pattern.length; i++) {
-            if (pattern[i] === '-') {
-                dontCarePositions.push(i);
-            }
-        }
-        
-        const numCombinations = Math.pow(2, dontCarePositions.length);
-        
-        for (let combo = 0; combo < numCombinations; combo++) {
-            let binaryStr = pattern;
-            
-            // 替換don't care位置
-            for (let i = 0; i < dontCarePositions.length; i++) {
-                const pos = dontCarePositions[i];
-                const bit = (combo >> i) & 1;
-                binaryStr = binaryStr.substring(0, pos) + bit + binaryStr.substring(pos + 1);
-            }
-            
-            // 計算decimal值
-            const decimalValue = parseInt(binaryStr, 2);
-            minterms.push(decimalValue);
-        }
-        
-        return minterms.sort((a, b) => a - b);
-    }
-
-    /**
-     * 計算 Prime Implicant 的成本
-     * 成本計算規則：
-     * - 單個 literal：成本 = 1（例如：y 的成本為 1）
-     * - 多個 literals：成本 = literal 數量 + 1（例如：x'z' 有 2 個符號，成本為 2 + 1 = 3）
-     * @param {string} pattern - PI 的二進制模式（如 "01-"）
-     * @returns {number} 計算出的成本
-     */
-    calculateCost(pattern) {
-        let literalCount = 0;
-        for (let i = 0; i < pattern.length; i++) {
-            if (pattern[i] !== '-') {
-                literalCount++;
-            }
-        }
-        // 正確的成本計算：
-        // 1 個 literal: cost = 1（例如：y 的成本為 1）
-        // 多個 literals: cost = literal_count + 1（例如：x'z' 有 2 個符號，成本為 2 + 1 = 3）
-        if (literalCount === 1) {
-            return 1;
-        } else {
-            return literalCount + 1;
-        }
-    }
-
-    /**
-     * 建立覆蓋表 (Coverage Table)
-     * 記錄每個 minterm 被哪些 Prime Implicants 覆蓋
-     * @returns {Object} 覆蓋表物件
-     */
-    buildCoverageTable() {
-        this.coverageTable = {};
-        
-        this.minterms.forEach(minterm => {
-            this.coverageTable[minterm] = [];
-            
-            this.primeImplicants.forEach((pi, index) => {
-                if (pi.minterms.includes(minterm)) {
-                    this.coverageTable[minterm].push(index);
-                }
-            });
-        });
-        
-        return this.coverageTable;
-    }
-
-    /**
-     * 找到必要 Prime Implicants (Essential PIs)
-     * 必要 PI 是唯一覆蓋某個 minterm 的 Prime Implicant
-     * @returns {Object} 包含必要 PIs 和被覆蓋 minterms 的物件
-     */
-    findEssentialPIs() {
-        this.essentialPIs = [];
-        const usedMinterms = new Set();
-        
-        this.minterms.forEach(minterm => {
-            const coveringPIs = this.coverageTable[minterm];
-            if (coveringPIs.length === 1) {
-                const piIndex = coveringPIs[0];
-                if (!this.essentialPIs.includes(piIndex)) {
-                    this.essentialPIs.push(piIndex);
-                    // 標記這個 PI 覆蓋的所有 minterms
-                    this.primeImplicants[piIndex].minterms.forEach(m => {
-                        if (this.minterms.includes(m)) {
-                            usedMinterms.add(m);
-                        }
-                    });
-                }
-            }
-        });
-        
-        return {
-            essentialPIs: this.essentialPIs,
-            coveredMinterms: Array.from(usedMinterms)
-        };
-    }
-
-    /**
-     * 生成 Quine-McCluskey Prime Implicants
-     * 使用 Quine-McCluskey 演算法逐層合併項目，生成所有可能的 implicants
-     * @param {Array} minterms - 目標 minterms 陣列
-     * @param {number} numVars - 變數數量
-     * @param {Array} dontCares - Don't Care 項目陣列
-     * @returns {Array} 生成的 Prime Implicants 陣列
-     */
-    generateQuineMcCluskeyPIs(minterms, numVars, dontCares = []) {
-        console.log(`生成 PI: minterms=[${minterms.join(',')}], numVars=${numVars}, dontCares=[${dontCares.join(',')}]`);
-        
-        // 確保所有項都是數字
-        const allTerms = [...minterms, ...dontCares].map(term => parseInt(term, 10));
-        const uniqueTerms = [...new Set(allTerms)].filter(term => !isNaN(term));
-        
-        // 轉換為二進制表示，作為第0層
-        let currentLevel = uniqueTerms.map(term => {
-            const binary = term.toString(2).padStart(numVars, '0');
-            console.log(`轉換 m${term} → ${binary}`);
-            return {
-                binary: binary,
-                minterms: [term],
-                level: 0
-            };
-        });
-        
-        // 保存所有層級的implicants
-        const allLevels = [currentLevel.slice()]; // 第0層：所有原始minterms
-        let levelNumber = 0;
-        
-        // 逐層生成更高級的implicants
-        while (currentLevel.length > 1) {
-            const nextLevel = [];
-            const usedIndices = new Set();
-            
-            // 按二進制中1的數量分組
-            const groups = {};
-            currentLevel.forEach((term, index) => {
-                const ones = (term.binary.match(/1/g) || []).length;
-                if (!groups[ones]) groups[ones] = [];
-                groups[ones].push({...term, index});
-            });
-            
-            // 嘗試組合相鄰組
-            const groupKeys = Object.keys(groups).map(Number).sort((a, b) => a - b);
-            
-            for (let i = 0; i < groupKeys.length - 1; i++) {
-                const group1 = groups[groupKeys[i]];
-                const group2 = groups[groupKeys[i + 1]];
-                
-                group1.forEach(term1 => {
-                    group2.forEach(term2 => {
-                        const combinedResult = this.combineBinaryTerms(term1.binary, term2.binary);
-                        if (combinedResult) {
-                            // 檢查是否已經存在相同的組合
-                            const existingTerm = nextLevel.find(t => t.binary === combinedResult);
-                            if (!existingTerm) {
-                                nextLevel.push({
-                                    binary: combinedResult,
-                                    minterms: [...new Set([...term1.minterms, ...term2.minterms])].sort((a, b) => a - b),
-                                    level: levelNumber + 1
-                                });
-                            }
-                            usedIndices.add(term1.index);
-                            usedIndices.add(term2.index);
-                        }
-                    });
-                });
-            }
-            
-            if (nextLevel.length === 0) break;
-            
-            levelNumber++;
-            allLevels.push(nextLevel.slice());
-            currentLevel = nextLevel;
-        }
-        
-        console.log(`生成了 ${allLevels.length} 層implicants`);
-        allLevels.forEach((level, i) => {
-            console.log(`第 ${i} 層: ${level.length} 個implicants`);
-        });
-        
-        // 所有層級的所有implicants都作為PI返回（按照您的要求）
-        const allImplicants = allLevels.flat();
-        
-        // 轉換為最終格式，只保留包含實際minterms的implicants
-        const primeImplicants = allImplicants
-            .map(implicant => {
-                const coveredMinterms = implicant.minterms.filter(m => minterms.includes(m));
-                return {
-                    pattern: implicant.binary,
-                    minterms: coveredMinterms,
-                    level: implicant.level
-                };
-            })
-            .filter(pi => pi.minterms.length > 0);
-        
-        // 按照層級和pattern排序
-        primeImplicants.sort((a, b) => {
-            if (a.level !== b.level) return a.level - b.level;
-            return a.pattern.localeCompare(b.pattern);
-        });
-        
-        console.log(`生成了所有 ${primeImplicants.length} 個implicants:`, primeImplicants);
-        return primeImplicants;
-    }
-
-    /**
-     * 找出真正的Prime Implicants
-     * 一個implicant是PI，如果它沒有被任何其他更大的implicant完全包含
-     */
-    findTruePrimeImplicants(allImplicants, minterms) {
-        // 按照用戶要求：所有生成的implicants都視為PI，包括原始minterms
-        const primeImplicants = [];
-        
-        allImplicants.forEach(implicant => {
-            // 只考慮包含實際minterms的implicants
-            const coveredMinterms = implicant.minterms.filter(m => minterms.includes(m));
-            if (coveredMinterms.length > 0) {
-                primeImplicants.push({
-                    pattern: implicant.pattern || implicant.binary, // 兼容兩種屬性名
-                    minterms: coveredMinterms
-                });
-            }
-        });
-        
-        return primeImplicants;
-    }
-
-    /**
-     * 檢查pattern1是否比pattern2更通用（包含更多的'-'）
-     */
-    isMoreGeneral(pattern1, pattern2) {
-        if (pattern1.length !== pattern2.length) return false;
-        
-        let moreGeneral = false;
-        for (let i = 0; i < pattern1.length; i++) {
-            if (pattern1[i] === '-' && pattern2[i] !== '-') {
-                moreGeneral = true;
-            } else if (pattern1[i] !== '-' && pattern2[i] === '-') {
-                return false;
-            } else if (pattern1[i] !== pattern2[i]) {
-                return false;
-            }
-        }
-        
-        return moreGeneral;
-    }
-
-    /**
-     * 組合兩個二進制項
-     */
-    combineBinaryTerms(bin1, bin2) {
-        if (bin1.length !== bin2.length) return null;
-        
-        let differences = 0;
-        let result = '';
-        
-        for (let i = 0; i < bin1.length; i++) {
-            if (bin1[i] !== bin2[i]) {
-                differences++;
-                if (differences > 1) return null;
-                result += '-';
-            } else {
-                result += bin1[i];
-            }
-        }
-        
-        return differences === 1 ? result : null;
-    }
-
-    /**
-     * 將pattern轉換為代數表達式
-     */
-    convertPatternToAlgebraic(pattern) {
-        let algebraic = '';
-        
-        for (let i = 0; i < pattern.length; i++) {
-            if (pattern[i] === '1') {
-                algebraic += this.variables[i] || `X${i}`;
-            } else if (pattern[i] === '0') {
-                algebraic += (this.variables[i] || `X${i}`) + "'";
-            }
-        }
-        
-        return algebraic || '1';
-    }
-
-    /**
-     * 執行多輸出最佳化
-     */
-    executeMultipleOutput(mintermsByFunction, numVars, dontCares = []) {
-        console.log('🚀 開始多輸出優化分析');
-        console.log('輸入函數:', mintermsByFunction);
-        
-        // 設定變數
-        if (!this.variables || this.variables.length === 0) {
-            this.variables = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H'].slice(0, numVars);
-        }
-        
-        this.calculationSteps = [];
-        
-        // 規範化輸入格式
-        const normalizedMinterms = {};
-        Object.entries(mintermsByFunction).forEach(([funcName, minterms]) => {
-            let mintermsArray;
-            if (Array.isArray(minterms)) {
-                mintermsArray = minterms.map(m => parseInt(m, 10)).filter(m => !isNaN(m));
-            } else if (typeof minterms === 'object' && minterms.minterms) {
-                mintermsArray = (minterms.minterms || []).map(m => parseInt(m, 10)).filter(m => !isNaN(m));
-            } else if (typeof minterms === 'string') {
-                mintermsArray = minterms.split(',').map(m => parseInt(m.trim(), 10)).filter(m => !isNaN(m));
-            } else {
-                console.error(`錯誤: ${funcName} 的 minterms 格式不正確:`, minterms);
-                mintermsArray = [];
-            }
-            normalizedMinterms[funcName] = mintermsArray;
-            console.log(`${funcName} 規範化後的minterms:`, mintermsArray);
-        });
-
-        // 檢測函數數量，決定PI生成策略
-        const functionCount = Object.keys(normalizedMinterms).length;
-        console.log(`檢測到 ${functionCount} 個函數`);
-        
-        // 步驟1: 為每個函數生成Prime Implicants
-        const functionPIs = {};
-        const allPIsByPattern = new Map();
-        
-        this.calculationSteps.push({
-            step: 1,
-            title: "🔧 為每個函數分別生成Prime Implicants",
-            description: functionCount === 1 ? 
-                "使用Quine-McCluskey演算法只生成真正的Prime Implicants" : 
-                "使用Quine-McCluskey演算法生成所有Implicants",
-            details: []
-        });
-        
-        Object.entries(normalizedMinterms).forEach(([funcName, mintermsArray]) => {
-            console.log(`\n為 ${funcName} 生成PI，minterms: [${mintermsArray.join(',')}]`);
-            
-            let pis;
-            if (functionCount === 1) {
-                // 單函數模式：只生成真正的Prime Implicants（迭代合成後的產物）
-                console.log('🎯 單函數模式：只生成Prime Implicants（迭代合成後的產物）');
-                pis = this.generateOnlyTruePrimeImplicants(mintermsArray, numVars, dontCares);
-            } else {
-                // 多函數模式：生成所有Implicants（迭代合成前後都有的產物）
-                console.log('🔧 多函數模式：生成所有Implicants（迭代合成前後都有的產物）');
-                const allImplicants = this.generateQuineMcCluskeyPIs(mintermsArray, numVars, dontCares);
-                pis = this.findTruePrimeImplicants(allImplicants, mintermsArray);
-            }
-            
-            functionPIs[funcName] = pis;
-            
-            this.calculationSteps[0].details.push(`${funcName} = Σm(${mintermsArray.join(',')})`);
-            this.calculationSteps[0].details.push(`生成的PIs:`);
-            
-            pis.forEach((pi, index) => {
-                const algebraic = this.convertPatternToAlgebraic(pi.pattern);
-                console.log(`${funcName}-PI${index+1}: pattern="${pi.pattern}", algebraic="${algebraic}", minterms=[${pi.minterms.join(',')}]`);
-                this.calculationSteps[0].details.push(`  ${funcName}-PI${index+1}: ${pi.pattern} → ${algebraic} (覆蓋: m${pi.minterms.join(',m')})`);
-                
-                const key = pi.pattern;
-                if (!allPIsByPattern.has(key)) {
-                    allPIsByPattern.set(key, {
-                        pattern: pi.pattern,
-                        minterms: pi.minterms.slice(),
-                        usedBy: [],
-                        cost: this.calculateCost(pi.pattern)
-                    });
-                }
-                
-                allPIsByPattern.get(key).usedBy.push(funcName);
-            });
-            
-                         this.calculationSteps[0].details.push('');
-        });
-
-        // 處理單函數情況
-        if (functionCount === 1) {
-            // 單函數模式：直接使用標準Patrick Method
-            const [funcName, mintermsArray] = Object.entries(normalizedMinterms)[0];
-            const pis = functionPIs[funcName];
-            
-            // 設置基本屬性
-            this.minterms = mintermsArray;
-            this.primeImplicants = pis.map((pi, index) => ({
-                name: `PI${index + 1}`,
-                pattern: pi.pattern,
-                minterms: pi.minterms,
-                cost: this.calculateCost(pi.pattern),
-                algebraic: this.convertPatternToAlgebraic(pi.pattern)
-            }));
-            
-            // 建立覆蓋表
-            console.log('單函數模式：建立覆蓋表...');
-            console.log('minterms:', this.minterms);
-            console.log('primeImplicants:', this.primeImplicants);
-            this.buildCoverageTable();
-            console.log('覆蓋表:', this.coverageTable);
-            
-            // 找到 Essential PIs
-            console.log('單函數模式：尋找 Essential PIs...');
-            const { essentialPIs, coveredMinterms } = this.findEssentialPIs();
-            console.log('Essential PIs:', essentialPIs);
-            console.log('已覆蓋的minterms:', coveredMinterms);
-            
-            this.calculationSteps.push({
-                step: 2,
-                title: "📊 覆蓋表分析與 Essential Prime Implicants",
-                description: "分析各 PI 對 minterms 的覆蓋情況",
-                details: [
-                    `Essential PIs: ${essentialPIs.length > 0 ? essentialPIs.map(i => `PI${i+1}`).join(', ') : '無'}`,
-                    `已覆蓋的minterms: [${coveredMinterms.join(',')}]`
-                ]
-            });
-            
-            // 使用 Patrick Method 找到最小覆蓋
-            const remainingMinterms = mintermsArray.filter(m => !coveredMinterms.includes(m));
-            console.log('剩餘未覆蓋的minterms:', remainingMinterms);
-            let minimalCovers = [];
-            
-            if (remainingMinterms.length > 0) {
-                console.log('需要找最小覆蓋...');
-                const availablePIs = this.primeImplicants.filter((pi, index) => !essentialPIs.includes(index));
-                console.log('可用PIs:', availablePIs);
-                minimalCovers = this.findAllMinimalCovers(remainingMinterms, availablePIs);
-                console.log('找到的最小覆蓋:', minimalCovers);
-            } else {
-                console.log('所有minterms都已被Essential PIs覆蓋');
-            }
-            
-            // 組合 Essential PIs 和最小覆蓋
-            console.log('組合 Essential PIs 和最小覆蓋...');
-            const finalSolutions = [];
-            if (minimalCovers.length === 0) {
-                console.log('使用 Essential PIs 作為解');
-                const essentialSolution = essentialPIs.map(index => this.primeImplicants[index]);
-                console.log('Essential solution:', essentialSolution);
-                finalSolutions.push(essentialSolution);
-            } else {
-                console.log('組合 Essential PIs 和最小覆蓋');
-                minimalCovers.forEach(cover => {
-                    const solution = [
-                        ...essentialPIs.map(index => this.primeImplicants[index]),
-                        ...cover.pis
-                    ];
-                    finalSolutions.push(solution);
-                });
-            }
-            
-            console.log('最終解數量:', finalSolutions.length);
-            console.log('最終解:', finalSolutions);
-            
-            // 轉換為返回格式 - 保存所有最佳解
-            const result = {};
-            const allSolutions = [];
-            
-            if (finalSolutions.length > 0) {
-                console.log('找到的所有解:', finalSolutions);
-                
-                // 轉換所有解決方案
-                finalSolutions.forEach((solution, index) => {
-                    const convertedSolution = {
-                        pis: solution.map(pi => ({
-                            pattern: pi.pattern,
-                            algebraic: this.convertPatternToAlgebraic(pi.pattern),
-                            minterms: pi.minterms,
-                            cost: this.calculateCost(pi.pattern)
-                        })),
-                        expression: solution.map(pi => this.convertPatternToAlgebraic(pi.pattern)).join(' + '),
-                        cost: solution.reduce((sum, pi) => sum + this.calculateCost(pi.pattern), 0)
-                    };
-                    allSolutions.push(convertedSolution);
-                    console.log(`解決方案 ${index + 1}:`, convertedSolution);
-                });
-                
-                // 主要結果使用第一個解
-                result[funcName] = allSolutions[0];
-                console.log('主要結果:', result[funcName]);
-            } else {
-                console.error('沒有找到任何解決方案！');
-            }
-            
-            this.calculationSteps.push({
-                step: 3,
-                title: "✅ 最終結果",
-                description: "單函數優化完成",
-                details: [`${funcName} = ${result[funcName]?.expression || '無解'}`]
-            });
-            
-            // 生成統一的解決方案格式（為前端顯示）
-            const formatSingleSolution = (solution) => {
-                const expressions = [`${funcName} = ${solution.expression}`];
-                const usedPIPatterns = solution.pis.map(pi => pi.pattern).sort();
-                return {
-                    expressions: expressions,
-                    usedPIPatterns: usedPIPatterns,
-                    sharedCost: solution.cost
-                };
-            };
-
-            const mainSolutionFormatted = result[funcName] ? 
-                formatSingleSolution(result[funcName]) : null;
-
-            // 格式化所有解決方案
-            const allFormattedSolutions = allSolutions.map(solution => formatSingleSolution(solution));
-
-            // 調試輸出
-            console.log('🎨 單函數格式化解決方案生成:');
-            console.log('mainSolutionFormatted:', mainSolutionFormatted);
-            console.log('allFormattedSolutions:', allFormattedSolutions);
-
-            // 包裝成前端期望的格式
-            return {
-                success: true,
-                solutions: result,
-                allSolutions: allSolutions,  // 添加所有解決方案
-                functionName: funcName,      // 添加函數名稱
-                calculationSteps: this.calculationSteps,
-                totalIndividualCost: result[funcName]?.cost || 0,
-                sharedOptimizedCost: result[funcName]?.cost || 0,
-                savings: 0,
-                sharedPIs: [],
-                // 新增：統一格式化的解決方案顯示
-                formattedSolution: mainSolutionFormatted,
-                allFormattedSolutions: allFormattedSolutions
-            };
-        }
-
-        // 處理多函數情況
-        // 步驟2: 分析PI共享情況
-        this.calculationSteps.push({
-            step: 2,
-            title: "📊 分析Prime Implicant共享情況",
-            description: "識別哪些PI可以被多個函數共享",
-            details: []
-        });
-        
-        const sharedPIs = [];
-        const exclusivePIs = [];
-        let piCounter = 1;
-        
-        allPIsByPattern.forEach((piInfo, pattern) => {
-            const algebraic = this.convertPatternToAlgebraic(pattern);
-            const usedByStr = piInfo.usedBy.join(', ');
-            
-            if (piInfo.usedBy.length > 1) {
-                sharedPIs.push(piInfo);
-                this.calculationSteps[1].details.push(`✅ 共享PI${piCounter}: ${pattern} → ${algebraic} (用於: ${usedByStr}, 成本: ${piInfo.cost})`);
-            } else {
-                exclusivePIs.push(piInfo);
-                this.calculationSteps[1].details.push(`⚪ 專用PI${piCounter}: ${pattern} → ${algebraic} (用於: ${usedByStr}, 成本: ${piInfo.cost})`);
-            }
-            piCounter++;
-        });
-        
-        this.calculationSteps[1].details.push('');
-        this.calculationSteps[1].details.push(`共享PI數量: ${sharedPIs.length}, 專用PI數量: ${exclusivePIs.length}`);
-
-        // 步驟3: 使用聯合Patrick Method解決多函數覆蓋問題
-        this.calculationSteps.push({
-            step: 3,
-            title: "🎯 使用聯合Patrick Method解決多函數覆蓋問題",
-            description: "一次性計算所有函數的最小覆蓋，考慮PI共享",
-            details: []
-        });
-
-        // 設置PI引用
-        this.setAllPIsByPattern(allPIsByPattern);
-        
-        // 建立聯合覆蓋表
-        const jointCoverageTable = this.buildJointCoverageTable(normalizedMinterms, allPIsByPattern);
-        
-            // 使用聯合Patrick Method找到最佳解
-    const jointSolutions = this.solveJointPatrickMethod(jointCoverageTable, allPIsByPattern, normalizedMinterms);
-    
-    // 生成系統解 - 處理所有最佳解 (加入去重機制)
-    const allSystemSolutions = [];
-    const seenSolutions = new Set(); // 用於去重
-        
-        jointSolutions.forEach((jointSolution, solutionIndex) => {
-            const systemSolution = {};
-            const usedPIs = new Set(); // 追蹤已使用的PI
-            
-            Object.entries(normalizedMinterms).forEach(([funcName, minterms]) => {
-                const functionPIs = [];
-                
-                jointSolution.forEach(pattern => {
-                    const piInfo = allPIsByPattern.get(pattern);
-                    if (piInfo && piInfo.usedBy.includes(funcName)) {
-                        const coveredMinterms = piInfo.minterms.filter(m => minterms.includes(m));
-                        if (coveredMinterms.length > 0) {
-                            functionPIs.push({
-                                pattern: pattern,
-                                algebraic: this.convertPatternToAlgebraic(pattern),
-                                minterms: coveredMinterms,
-                                cost: piInfo.cost
-                            });
-                        }
-                    }
-                });
-                
-                if (functionPIs.length > 0) {
-                    // 🔍 嘗試使用保存的Stage 2結果
-                    const stage2Key = [...jointSolution].sort().join(',');
-                    let optimizedPIs;
-                    
-                    if (this._stage2Cache && this._stage2Cache.has(stage2Key)) {
-                        console.log(`💾 使用緩存的Stage 2結果 for ${funcName}`);
-                        optimizedPIs = this._stage2Cache.get(stage2Key)[funcName] || functionPIs;
-                    } else {
-                        console.log(`🔄 重新計算Stage 2結果 for ${funcName}`);
-                        optimizedPIs = this.removeRedundantPIsForStage2(functionPIs, minterms);
-                    }
-                    
-                    // 確保optimizedPIs有algebraic屬性
-                    optimizedPIs = optimizedPIs.map(pi => ({
-                        ...pi,
-                        algebraic: pi.algebraic || this.convertPatternToAlgebraic(pi.pattern)
-                    }));
-                    
-                    optimizedPIs.forEach(pi => {
-                        usedPIs.add(pi.pattern);
-                    });
-                    
-                    systemSolution[funcName] = {
-                        pis: optimizedPIs,
-                        expression: optimizedPIs.map(pi => pi.algebraic).join(' + '),
-                        cost: optimizedPIs.reduce((sum, pi) => sum + pi.cost, 0) // 函數個別成本
-                    };
-                    
-                    console.log(`${funcName} 最終表達式: ${systemSolution[funcName].expression}`);
-                }
-            });
-            
-            // 計算真正的Stage 3共享成本並獲取Stage 2優化後的PI組合
-            const originalLog = console.log;
-            console.log = () => {}; // 暫時禁用
-            const stage3Cost = this.calculateThreeStagesCost(jointSolution, normalizedMinterms, allPIsByPattern);
-            console.log = originalLog; // 恢復
-            
-            // 獲取Stage 2優化後的實際PI組合
-            const stage2OptimizedPIs = new Set();
-            Object.entries(normalizedMinterms).forEach(([funcName, minterms]) => {
-                const functionPIs = [];
-                jointSolution.forEach(pattern => {
-                    const piInfo = allPIsByPattern.get(pattern);
-                    if (piInfo && piInfo.usedBy.includes(funcName)) {
-                        const coveredMinterms = piInfo.minterms.filter(m => minterms.includes(m));
-                        if (coveredMinterms.length > 0) {
-                            functionPIs.push({
-                                pattern: pattern,
-                                minterms: coveredMinterms,
-                                cost: piInfo.cost
-                            });
-                        }
-                    }
-                });
-                
-                if (functionPIs.length > 0) {
-                    // 進行Stage 2冗餘移除
-                    const optimizedPIs = this.removeRedundantPIsForStage2(functionPIs, minterms);
-                    optimizedPIs.forEach(pi => {
-                        stage2OptimizedPIs.add(pi.pattern);
-                    });
-                }
-            });
-            
-            systemSolution._sharedOptimizedCost = stage3Cost;
-            systemSolution._usedPIPatterns = Array.from(usedPIs);
-            systemSolution._stage2OptimizedPIs = Array.from(stage2OptimizedPIs).sort();
-            
-            // 去重：根據Stage 2優化後的PI組合創建唯一標識
-            const stage2PIKey = systemSolution._stage2OptimizedPIs.join(',');
-            
-            if (!seenSolutions.has(stage2PIKey)) {
-                seenSolutions.add(stage2PIKey);
-                allSystemSolutions.push(systemSolution);
-            }
-        });
-        
-        // 使用第一個解作為主要解，但只保留函數部分
-        let solutions = {};
-        let sharedOptimizedCost = 0;
-        let totalIndividualCost = 0;
-        
-        if (allSystemSolutions.length > 0) {
-            const firstSystemSolution = allSystemSolutions[0];
-            
-            // 只提取函數部分，排除內部屬性
-            Object.entries(firstSystemSolution).forEach(([key, value]) => {
-                if (!key.startsWith('_')) {
-                    solutions[key] = value;
-                }
-            });
-            
-            // 獲取內部屬性
-            sharedOptimizedCost = firstSystemSolution._sharedOptimizedCost || 0;
-            
-            // 計算個別優化總成本
-            totalIndividualCost = Object.values(solutions).reduce((sum, sol) => sum + sol.cost, 0);
-        }
-        
-        const savings = totalIndividualCost - sharedOptimizedCost;
-        
-        // 準備所有解的詳細信息
-        const allSolutionsDetails = allSystemSolutions.map((systemSol, index) => {
-            const solutionSummary = {
-                solutionNumber: index + 1,
-                usedPIPatterns: systemSol._stage2OptimizedPIs || systemSol._usedPIPatterns,
-                sharedCost: systemSol._sharedOptimizedCost,
-                functions: {}
-            };
-            
-            Object.entries(systemSol).forEach(([funcName, funcSol]) => {
-                if (!funcName.startsWith('_')) {
-                    solutionSummary.functions[funcName] = {
-                        expression: funcSol.expression,
-                        pis: funcSol.pis.map(pi => pi.pattern),
-                        cost: funcSol.cost
-                    };
-                }
-            });
-            
-            return solutionSummary;
-        });
-        
-        // 添加多解詳情到計算步驟
-        if (allSystemSolutions.length > 1) {
-            this.calculationSteps[2].details.push('');
-            this.calculationSteps[2].details.push(`🔍 找到 ${allSystemSolutions.length} 個最佳解：`);
-            allSolutionsDetails.forEach((sol, index) => {
-                this.calculationSteps[2].details.push(`解 ${index + 1}:`);
-                this.calculationSteps[2].details.push(`  使用PI: ${sol.usedPIPatterns.join(', ')}`);
-                this.calculationSteps[2].details.push(`  共享成本: ${sol.sharedCost}`);
-                Object.entries(sol.functions).forEach(([funcName, funcData]) => {
-                    this.calculationSteps[2].details.push(`  ${funcName}: ${funcData.expression} (PI: ${funcData.pis.join(', ')})`);
-                });
-                this.calculationSteps[2].details.push('');
-            });
-        }
-        
-        // 生成統一的解決方案格式（為前端顯示）
-        const formatSolution = (systemSol) => {
-            const functionExpressions = [];
-            const allUsedPIs = new Set();
-            
-            // 按函數名稱排序
-            const sortedFunctions = Object.entries(systemSol)
-                .filter(([key]) => !key.startsWith('_'))
-                .sort(([a], [b]) => a.localeCompare(b));
-            
-            sortedFunctions.forEach(([funcName, funcData]) => {
-                functionExpressions.push(`${funcName} = ${funcData.expression}`);
-                funcData.pis.forEach(pi => allUsedPIs.add(pi.pattern));
-            });
-            
-            return {
-                expressions: functionExpressions,
-                usedPIPatterns: systemSol._stage2OptimizedPIs || Array.from(allUsedPIs).sort(),
-                sharedCost: systemSol._sharedOptimizedCost || 0
-            };
-        };
-
-        // 格式化主要解決方案
-        const mainSolutionFormatted = allSystemSolutions.length > 0 ? 
-            formatSolution(allSystemSolutions[0]) : null;
-        
-        // 格式化所有解決方案
-        const allFormattedSolutions = allSystemSolutions.map((sol, index) => ({
-            solutionNumber: index + 1,
-            ...formatSolution(sol)
-        }));
-
-        // 調試輸出
-        console.log('🎨 格式化解決方案生成:');
-        console.log('mainSolutionFormatted:', mainSolutionFormatted);
-        console.log('allFormattedSolutions:', allFormattedSolutions);
-
-        // 包裝成前端期望的格式
-        return {
-            success: true,
-            solutions: solutions,
-            calculationSteps: this.calculationSteps,
-            totalIndividualCost: totalIndividualCost,
-            sharedOptimizedCost: sharedOptimizedCost,
-            savings: savings,
-            sharedPIs: Array.from(allPIsByPattern.entries())
-                .filter(([, piInfo]) => piInfo.usedBy.length > 1)
-                .map(([pattern, piInfo]) => ({
-                    pattern: pattern,
-                    algebraic: this.convertPatternToAlgebraic(pattern),
-                    usedBy: piInfo.usedBy,
-                    cost: piInfo.cost
-                })),
-            allSolutions: allSolutionsDetails.length > 1 ? allSolutionsDetails : undefined,
-            // 新增：統一格式化的解決方案顯示
-            formattedSolution: mainSolutionFormatted,
-            allFormattedSolutions: allFormattedSolutions.length > 0 ? allFormattedSolutions : undefined
-        };
-    }
-
-    /**
-     * 執行單函數優化
-     */
-    executeSingleFunctionOptimization(normalizedMinterms, numVars, dontCares = []) {
-        const [funcName, mintermsArray] = Object.entries(normalizedMinterms)[0];
-        console.log(`單函數優化：${funcName} = Σm(${mintermsArray.join(',')})`);
-        
-        this.calculationSteps.push({
-            step: 1,
-            title: "🎯 單函數 Prime Implicants 生成",
-            description: "使用 Quine-McCluskey 算法生成真正的 Prime Implicants",
-            details: [`${funcName} = Σm(${mintermsArray.join(',')})`]
-        });
-        
-        // 生成真正的 Prime Implicants（使用 web 版本的方法）
-        const truePIs = this.generateTruePrimeImplicantsForSingleFunction(mintermsArray, numVars, dontCares);
-        
-        this.calculationSteps[0].details.push(`生成的 Prime Implicants:`);
-        truePIs.forEach((pi, index) => {
-            const algebraic = this.convertPatternToAlgebraic(pi.pattern);
-            this.calculationSteps[0].details.push(`  PI${index+1}: ${pi.pattern} → ${algebraic} (覆蓋: m${pi.minterms.join(',m')})`);
-        });
-        
-        // 設置基本屬性
-        this.minterms = mintermsArray;
-        this.primeImplicants = truePIs.map((pi, index) => ({
-            name: `PI${index + 1}`,
-            pattern: pi.pattern,
-            minterms: pi.minterms
-        }));
-        
-        // 建立覆蓋表
-        console.log('建立覆蓋表...');
-        this.buildCoverageTable();
-        console.log('覆蓋表:', this.coverageTable);
-        
-        // 找到 Essential PIs
-        console.log('尋找 Essential PIs...');
-        const { essentialPIs, coveredMinterms } = this.findEssentialPIs();
-        console.log('Essential PIs:', essentialPIs);
-        console.log('已覆蓋的minterms:', coveredMinterms);
-        
-        this.calculationSteps.push({
-            step: 2,
-            title: "📊 覆蓋表分析與 Essential Prime Implicants",
-            description: "分析各 PI 對 minterms 的覆蓋情況",
-            details: [
-                `Essential PIs: ${essentialPIs.length > 0 ? essentialPIs.map(i => `PI${i+1}`).join(', ') : '無'}`,
-                `已覆蓋的minterms: [${coveredMinterms.join(',')}]`
-            ]
-        });
-        
-        // 使用 Patrick Method 找到最小覆蓋
-        const remainingMinterms = mintermsArray.filter(m => !coveredMinterms.includes(m));
-        console.log('剩餘未覆蓋的minterms:', remainingMinterms);
-        let minimalCovers = [];
-        
-        if (remainingMinterms.length > 0) {
-            console.log('尋找最小覆蓋...');
-            const availablePIs = this.primeImplicants.filter((pi, index) => !essentialPIs.includes(index));
-            console.log('可用PIs數量:', availablePIs.length);
-            try {
-                minimalCovers = this.findAllMinimalCovers(remainingMinterms, availablePIs);
-                console.log('找到的最小覆蓋數量:', minimalCovers.length);
-            } catch (error) {
-                console.error('尋找最小覆蓋時發生錯誤:', error);
-                throw new Error(`Patrick Method執行失敗: ${error.message}`);
-            }
-        } else {
-            console.log('所有minterms都已被Essential PIs覆蓋');
-        }
-        
-        // 組合 Essential PIs 和最小覆蓋
-        console.log('組合 Essential PIs 和最小覆蓋...');
-        const finalSolutions = [];
-        
-        try {
-            if (minimalCovers.length === 0) {
-                // 只需要 Essential PIs
-                console.log('使用 Essential PIs 作為最終解');
-                const essentialSolution = essentialPIs.map(index => this.primeImplicants[index]);
-                finalSolutions.push(essentialSolution);
-            } else {
-                // 每個最小覆蓋都加上 Essential PIs
-                console.log(`組合 ${minimalCovers.length} 個最小覆蓋與 Essential PIs`);
-                minimalCovers.forEach(cover => {
-                    const solution = [
-                        ...essentialPIs.map(index => this.primeImplicants[index]),
-                        ...cover
-                    ];
-                    finalSolutions.push(solution);
-                });
-            }
-            
-            console.log(`生成了 ${finalSolutions.length} 個最終解`);
-            
-            // 轉換為返回格式
-            const result = {};
-            if (finalSolutions.length > 0) {
-                const bestSolution = finalSolutions[0];
-                console.log('最佳解包含的PIs:', bestSolution.map(pi => pi.pattern));
-                
-                result[funcName] = {
-                    pis: bestSolution.map(pi => ({
-                        pattern: pi.pattern,
-                        algebraic: this.convertPatternToAlgebraic(pi.pattern),
-                        minterms: pi.minterms,
-                        cost: this.calculateCost(pi.pattern)
-                    })),
-                    expression: bestSolution.map(pi => this.convertPatternToAlgebraic(pi.pattern)).join(' + '),
-                    cost: bestSolution.reduce((sum, pi) => sum + this.calculateCost(pi.pattern), 0)
-                };
-                
-                console.log('最終表達式:', result[funcName].expression);
-                console.log('總成本:', result[funcName].cost);
-            } else {
-                console.error('無法生成有效解');
-                throw new Error('無法生成有效的最小覆蓋解');
-            }
-            
-            this.calculationSteps.push({
-                step: 3,
-                title: "✅ 最終結果",
-                description: "單函數優化完成",
-                details: [`${funcName} = ${result[funcName]?.expression || '無解'}`]
-            });
-            
-            this.calculationSteps.push({
-                step: 3,
-                title: "✅ 最終結果", 
-                description: "單函數優化完成",
-                details: [`${funcName} = ${result[funcName]?.expression || '無解'}`]
-            });
-            
-            console.log('單函數優化完成');
-            return result;
-            
-        } catch (error) {
-            console.error('組合最終解時發生錯誤:', error);
-            this.calculationSteps.push({
-                step: 3,
-                title: "❌ 錯誤",
-                description: "單函數優化失敗",
-                details: [error.message]
-            });
-            throw new Error(`單函數優化失敗: ${error.message}`);
-        }
-    }
-
-    /**
-     * 執行多函數優化（原本的邏輯）
-     */
-    executeMultipleFunctionOptimization(normalizedMinterms, numVars, dontCares = []) {
-        // 步驟1: 為每個函數生成Prime Implicants
-        const functionPIs = {};
-        const allPIsByPattern = new Map();
-        
-        this.calculationSteps.push({
-            step: 1,
-            title: "🔧 為每個函數分別生成Prime Implicants",
-            description: "使用Quine-McCluskey演算法為每個函數獨立生成PI",
-            details: []
-        });
-        
-        Object.entries(normalizedMinterms).forEach(([funcName, mintermsArray]) => {
-            console.log(`\n為 ${funcName} 生成PI，minterms: [${mintermsArray.join(',')}]`);
-            
-            // 多函數模式：生成所有可能的 Implicants（包括非 Prime）
-            const allImplicants = this.generateQuineMcCluskeyPIs(mintermsArray, numVars, dontCares);
-            const pis = this.findTruePrimeImplicants(allImplicants, mintermsArray);
-            functionPIs[funcName] = pis;
-            
-            this.calculationSteps[0].details.push(`${funcName} = Σm(${mintermsArray.join(',')})`);
-            this.calculationSteps[0].details.push(`生成的PIs:`);
-            
-            pis.forEach((pi, index) => {
-                const algebraic = this.convertPatternToAlgebraic(pi.pattern);
-                console.log(`${funcName}-PI${index+1}: pattern="${pi.pattern}", algebraic="${algebraic}", minterms=[${pi.minterms.join(',')}]`);
-                this.calculationSteps[0].details.push(`  ${funcName}-PI${index+1}: ${pi.pattern} → ${algebraic} (覆蓋: m${pi.minterms.join(',m')})`);
-                
-                const key = pi.pattern;
-                if (!allPIsByPattern.has(key)) {
-                    allPIsByPattern.set(key, {
-                        pattern: pi.pattern,
-                        minterms: pi.minterms.slice(),
-                        usedBy: [],
-                        cost: this.calculateCost(pi.pattern)
-                    });
-                }
-                
-                allPIsByPattern.get(key).usedBy.push(funcName);
-            });
-            
-            this.calculationSteps[0].details.push('');
-        });
-
-        // 步驟2: 分析PI共享情況
-        this.calculationSteps.push({
-            step: 2,
-            title: "📊 分析Prime Implicant共享情況",
-            description: "識別哪些PI可以被多個函數共享",
-            details: []
-        });
-        
-        const sharedPIs = [];
-        const exclusivePIs = [];
-        let piCounter = 1;
-        
-        allPIsByPattern.forEach((piInfo, pattern) => {
-            const algebraic = this.convertPatternToAlgebraic(pattern);
-            const usedByStr = piInfo.usedBy.join(', ');
-            
-            if (piInfo.usedBy.length > 1) {
-                sharedPIs.push(piInfo);
-                this.calculationSteps[1].details.push(`✅ 共享PI${piCounter}: ${pattern} → ${algebraic} (用於: ${usedByStr}, 成本: ${piInfo.cost})`);
-            } else {
-                exclusivePIs.push(piInfo);
-                this.calculationSteps[1].details.push(`⚪ 專用PI${piCounter}: ${pattern} → ${algebraic} (用於: ${usedByStr}, 成本: ${piInfo.cost})`);
-            }
-            piCounter++;
-        });
-        
-        this.calculationSteps[1].details.push('');
-        this.calculationSteps[1].details.push(`共享PI數量: ${sharedPIs.length}, 專用PI數量: ${exclusivePIs.length}`);
-
-        // 步驟3: 使用聯合Patrick Method解決多函數覆蓋問題
-        this.calculationSteps.push({
-            step: 3,
-            title: "🎯 使用聯合Patrick Method解決多函數覆蓋問題",
-            description: "一次性計算所有函數的最小覆蓋，考慮PI共享",
-            details: []
-        });
-
-        // 設置PI引用
-        this.setAllPIsByPattern(allPIsByPattern);
-        
-        // 建立聯合覆蓋表
-        const jointCoverageTable = this.buildJointCoverageTable(normalizedMinterms, allPIsByPattern);
-        
-            // 使用聯合Patrick Method找到最佳解
-    const jointSolutions = this.solveJointPatrickMethod(jointCoverageTable, allPIsByPattern, normalizedMinterms);
-    
-    // 生成系統解
-    const systemSolutions = this.generateSystemSolutionsFromJoint(jointSolutions, normalizedMinterms);
-        console.log(`🔍 systemSolutions數量: ${systemSolutions.length}`);
-        console.log(`🔍 jointSolutions數量: ${jointSolutions.length}`);
-        let solutions = {};
-        
-        // 如果系統解生成失敗，回退到基本解
-        if (systemSolutions.length > 0) {
-            console.log(`✅ 使用系統解路徑`);
-        
-            // 只提取函數部分，排除內部屬性
-            const firstSystemSolution = systemSolutions[0];
-            Object.entries(firstSystemSolution).forEach(([key, value]) => {
-                if (!key.startsWith('_')) {
-                    solutions[key] = value;
-                }
-            });
-        } else if (jointSolutions.length > 0) {
-            console.log(`⚠️ 使用回退路徑：手動構建解決方案`);
-            // 手動構建解決方案
-            const bestSolution = jointSolutions[0];
-            Object.entries(normalizedMinterms).forEach(([funcName, minterms]) => {
-                const functionPIs = [];
-                
-                bestSolution.forEach(pattern => {
-                    const piInfo = allPIsByPattern.get(pattern);
-                    if (piInfo && piInfo.usedBy.includes(funcName)) {
-                        const coveredMinterms = piInfo.minterms.filter(m => minterms.includes(m));
-                        if (coveredMinterms.length > 0) {
-                            functionPIs.push({
-                                pattern: pattern,
-                                algebraic: this.convertPatternToAlgebraic(pattern),
-                                minterms: coveredMinterms,
-                                cost: piInfo.cost
-                            });
-                        }
-                    }
-                });
-                
-                if (functionPIs.length > 0) {
-                    // 🔍 嘗試使用保存的Stage 2結果
-                    const stage2Key = [...bestSolution].sort().join(',');
-                    let optimizedPIs;
-                    
-                    if (this._stage2Cache && this._stage2Cache.has(stage2Key)) {
-                        console.log(`💾 使用緩存的Stage 2結果 for ${funcName}`);
-                        optimizedPIs = this._stage2Cache.get(stage2Key)[funcName] || [];
-                    } else {
-                        console.log(`🔄 重新計算Stage 2結果 for ${funcName}`);
-                        optimizedPIs = this.removeRedundantPIsForStage2(functionPIs, minterms);
-                    }
-                    
-                    solutions[funcName] = {
-                        pis: optimizedPIs,
-                        expression: optimizedPIs.map(pi => pi.algebraic).join(' + '),
-                        cost: optimizedPIs.reduce((sum, pi) => sum + pi.cost, 0)
-                    };
-                    
-                    console.log(`${funcName} 最終表達式: ${solutions[funcName].expression}`);
-                }
-            });
-        }
-        
-        // 計算個別成本
-        console.log('開始計算個別成本...');
-        let totalIndividualCost = 0;
-        Object.entries(normalizedMinterms).forEach(([funcName, minterms]) => {
-            console.log(`計算 ${funcName} 的個別成本...`);
-            const functionPIs = [];
-            allPIsByPattern.forEach((piInfo, pattern) => {
-                if (piInfo.usedBy.includes(funcName)) {
-                    const coveredMinterms = piInfo.minterms.filter(m => minterms.includes(m));
-                    if (coveredMinterms.length > 0) {
-                        functionPIs.push({
-                            pattern: pattern,
-                            algebraic: this.convertPatternToAlgebraic(pattern),
-                            minterms: coveredMinterms,
-                            cost: piInfo.cost
-                        });
-                    }
-                }
-            });
-            
-            console.log(`${funcName} 可用PI數量: ${functionPIs.length}`);
-            
-            // 簡化個別成本計算，避免複雜的窮舉
-            const individualCost = functionPIs.reduce((sum, pi) => sum + pi.cost, 0);
-            totalIndividualCost += individualCost;
-            console.log(`${funcName} 個別成本: ${individualCost}`);
-        });
-        console.log('個別成本計算完成');
-
-        // 步驟4: 計算共享最佳化
-        this.calculationSteps.push({
-            step: 4,
-            title: "⚡ 共享最佳化分析",
-            description: "分析使用共享PI的成本效益",
-            details: []
-        });
-
-        // 計算聯合Patrick Method的實際成本
-        let jointMethodCost = 0;
-        const piUsageCount = new Map();
-        
-        // 從聯合解中獲取使用的PI並計算實際成本
-        if (jointSolutions.length > 0) {
-            const usedPIs = jointSolutions[0]; // 取第一個最佳解
-            usedPIs.forEach(pattern => {
-                const piCost = allPIsByPattern.get(pattern).cost;
-                jointMethodCost += piCost;
-                
-                // 統計PI使用次數（基於哪些函數使用了此PI）
-                const piInfo = allPIsByPattern.get(pattern);
-                piUsageCount.set(pattern, piInfo.usedBy.length);
-            });
-        }
-
-        // 計算節省的成本：個別最佳化總成本 - 聯合最佳化成本
-        const actualSavings = totalIndividualCost - jointMethodCost;
-
-        this.calculationSteps[3].details.push(`個別最佳化總成本: ${totalIndividualCost}`);
-        this.calculationSteps[3].details.push(`聯合Patrick Method成本: ${jointMethodCost}`);
-        this.calculationSteps[3].details.push(`節省成本: ${actualSavings} (${((actualSavings/totalIndividualCost)*100).toFixed(1)}%)`);
-        this.calculationSteps[3].details.push('');
-
-        // 顯示PI使用統計
-        this.calculationSteps[3].details.push('PI使用統計:');
-        piUsageCount.forEach((count, pattern) => {
-            const algebraic = this.convertPatternToAlgebraic(pattern);
-            const piCost = allPIsByPattern.get(pattern).cost;
-            const usedBy = allPIsByPattern.get(pattern).usedBy;
-            this.calculationSteps[3].details.push(`  ${pattern} → ${algebraic} (成本: ${piCost}, 用於: ${usedBy.join(', ')})`);
-        });
-
-        if (sharedPIs.length > 0) {
-            this.calculationSteps[3].details.push('');
-            this.calculationSteps[3].details.push('共享的Prime Implicants:');
-            sharedPIs.forEach(pi => {
-                const algebraic = this.convertPatternToAlgebraic(pi.pattern);
-                this.calculationSteps[3].details.push(`  ${pi.pattern} → ${algebraic} (${pi.usedBy.join(', ')})`);
-            });
-        }
-
-        return {
-            success: true,
-            solutions: solutions,
-            systemSolutions: systemSolutions,
-            sharedPIs: sharedPIs,
-            totalIndividualCost: totalIndividualCost,
-            sharedOptimizedCost: jointMethodCost,
-            savings: actualSavings,
-            calculationSteps: this.calculationSteps,
-            allPIs: Array.from(allPIsByPattern.values()),
-            outputFunctions: normalizedMinterms
-        };
-    }
-
-    /**
-     * 找到最小覆蓋（窮舉所有最佳解）
-     */
-    findMinimalCover(targetMinterms, availablePIs) {
-        const solutions = this.findAllMinimalCovers(targetMinterms, availablePIs);
-        
-        if (solutions.length === 0) {
-            return {
-                pis: [],
-                cost: 0,
-                expression: '0',
-                allSolutions: []
-            };
-        }
-
-        // 返回第一個解，但保留所有解的信息
-        const firstSolution = solutions[0];
-        return {
-            pis: firstSolution.pis,
-            cost: firstSolution.cost,
-            expression: firstSolution.expression,
-            allSolutions: solutions
-        };
-    }
-
-    /**
-     * 找到所有最小成本覆蓋解
-     */
-    findAllMinimalCovers(targetMinterms, availablePIs) {
-        const allSolutions = [];
-        let minCost = Infinity;
-
-        // 窮舉所有可能的PI組合
-        const numPIs = availablePIs.length;
-        const maxCombinations = Math.pow(2, numPIs);
-
-        for (let combination = 1; combination < maxCombinations; combination++) {
-            const selectedPIs = [];
-            let totalCost = 0;
-            const coveredMinterms = new Set();
-
-            // 檢查這個組合包含哪些PI
-            for (let i = 0; i < numPIs; i++) {
-                if (combination & (1 << i)) {
-                    const pi = availablePIs[i];
-                    selectedPIs.push(pi);
-                    totalCost += pi.cost;
-                    pi.minterms.forEach(m => {
-                        if (targetMinterms.includes(m)) {
-                            coveredMinterms.add(m);
-                        }
-                    });
-                }
-            }
-
-            // 檢查是否覆蓋所有目標minterms
-            const isValidCover = targetMinterms.every(m => coveredMinterms.has(m));
-
-            if (isValidCover) {
-                if (totalCost < minCost) {
-                    // 找到更低成本的解，清空之前的解
-                    minCost = totalCost;
-                    allSolutions.length = 0;
-                    allSolutions.push({
-                        pis: selectedPIs.slice(),
-                        cost: totalCost,
-                        expression: selectedPIs.map(pi => pi.algebraic).join(' + ')
-                    });
-                } else if (totalCost === minCost) {
-                    // 找到相同成本的解
-                    allSolutions.push({
-                        pis: selectedPIs.slice(),
-                        cost: totalCost,
-                        expression: selectedPIs.map(pi => pi.algebraic).join(' + ')
-                    });
-                }
-            }
-        }
-
-        return allSolutions;
-    }
-
-    /**
-     * 生成所有系統解組合
-     */
-    generateSystemSolutions(functionSolutions) {
-        const funcNames = Object.keys(functionSolutions);
-        const systemSolutions = [];
-
-        // 計算所有組合的數量
-        let totalCombinations = 1;
-        const solutionCounts = {};
-        
-        funcNames.forEach(funcName => {
-            const solutions = functionSolutions[funcName].allSolutions || [functionSolutions[funcName]];
-            solutionCounts[funcName] = solutions.length;
-            totalCombinations *= solutions.length;
-        });
-
-        // 生成所有組合
-        for (let combination = 0; combination < totalCombinations; combination++) {
-            const systemSolution = {};
-            let combinationIndex = combination;
-
-            // 為每個函數選擇一個解
-            for (let i = funcNames.length - 1; i >= 0; i--) {
-                const funcName = funcNames[i];
-                const solutions = functionSolutions[funcName].allSolutions || [functionSolutions[funcName]];
-                const solutionIndex = combinationIndex % solutions.length;
-                combinationIndex = Math.floor(combinationIndex / solutions.length);
-
-                systemSolution[funcName] = solutions[solutionIndex];
-            }
-
-            systemSolutions.push(systemSolution);
-        }
-
-        return systemSolutions;
-    }
-
-    /**
-     * 建立聯合覆蓋表
-     */
-    buildJointCoverageTable(normalizedMinterms, allPIsByPattern) {
-        const coverageTable = {};
-        
-        // 為每個函數的每個minterm建立覆蓋項
-        Object.entries(normalizedMinterms).forEach(([funcName, minterms]) => {
-            minterms.forEach(minterm => {
-                const key = `${funcName}-m${minterm}`;
-                coverageTable[key] = [];
-                
-                allPIsByPattern.forEach((piInfo, pattern) => {
-                    if (piInfo.usedBy.includes(funcName) && piInfo.minterms.includes(minterm)) {
-                        coverageTable[key].push(pattern);
-                    }
-                });
-            });
-        });
-        
-        return coverageTable;
-    }
-
-    /**
-     * 解決聯合Patrick Method（使用成本剪枝的窮舉算法）
-     */
-    solveJointPatrickMethod(coverageTable, allPIsByPattern, normalizedMinterms = null) {
-        // 建立Patrick表達式：每個minterm必須被至少一個PI覆蓋
-        const patrickTerms = Object.values(coverageTable);
-        const allPIPatterns = Array.from(allPIsByPattern.keys());
-        
-        this.calculationSteps[2].details.push(`建立Patrick表達式:`);
-        Object.entries(coverageTable).forEach(([key, pis]) => {
-            this.calculationSteps[2].details.push(`${key}: (${pis.join(' + ')})`);
-        });
-        this.calculationSteps[2].details.push('');
-        
-        // 使用成本剪枝的窮舉算法
-        const numPIs = allPIPatterns.length;
-        console.log(`總PI數量: ${numPIs}`);
-        console.log('使用成本剪枝的窮舉算法');
-        
-        return this.solveWithCostPruning(coverageTable, allPIsByPattern, normalizedMinterms);
-    }
-    
-    /**
-     * 成本剪枝的窮舉算法
-     */
-    solveWithCostPruning(coverageTable, allPIsByPattern, normalizedMinterms = null) {
-        const patrickTerms = Object.values(coverageTable);
-        const allPIPatterns = Array.from(allPIsByPattern.keys());
-        
-        let minCost = 10000; // 初始最小成本
-        let optimalSolutions = [];
-        let checkedCombinations = 0;
-        let prunedCombinations = 0;
-        
-        this.calculationSteps[2].details.push(`使用成本剪枝的回溯算法 (PI數量: ${allPIPatterns.length})`);
-        this.calculationSteps[2].details.push(`初始最小成本閾值: ${minCost}`);
-        this.calculationSteps[2].details.push('');
-        
-        // 檢查當前解是否覆蓋所有項目
-        const isValidCover = (solution) => {
-            return patrickTerms.every(term => term.some(pi => solution.includes(pi)));
-        };
-        
-        // 計算還需要覆蓋的項目
-        const getUncoveredTerms = (solution) => {
-            return patrickTerms.filter(term => !term.some(pi => solution.includes(pi)));
-        };
-        
-        // 估算剩餘最小成本（保守的啟發式剪枝）
-        const estimateMinRemainingCost = (uncoveredTerms, availablePIs) => {
-            if (uncoveredTerms.length === 0) return 0;
-            
-            // 使用更保守的估算：假設每個未覆蓋項目至少需要成本3的PI
-            // 這樣可以避免過度剪枝
-            return Math.ceil(uncoveredTerms.length / 4) * 3; // 假設每個PI平均覆蓋4個項目，成本3
-        };
-        
-        // 改進的回溯搜索
-        const backtrackSearch = (currentSolution, currentCost, availablePIs, startIndex = 0) => {
-            // 成本剪枝
-            if (currentCost >= minCost) {
-                prunedCombinations++;
-                return;
-            }
-            
-            // 檢查是否已經是有效解
-            if (isValidCover(currentSolution)) {
-                checkedCombinations++;
-                
-                if (currentCost < minCost) {
-                    minCost = currentCost;
-                    optimalSolutions = [currentSolution.slice()];
-                    console.log(`找到更優解，成本: ${minCost}, 解: ${currentSolution.join(',')}`);
-                } else if (currentCost === minCost) {
-                    optimalSolutions.push(currentSolution.slice());
-                    console.log(`找到相同成本解，成本: ${minCost}, 解: ${currentSolution.join(',')}`);
-                }
-                return;
-            }
-            
-            // 保守的啟發式剪枝：只在差距很大時才剪枝
-            const uncoveredTerms = getUncoveredTerms(currentSolution);
-            const estimatedMinCost = estimateMinRemainingCost(uncoveredTerms, availablePIs);
-            
-            // 只有當估算的總成本明顯超過當前最小成本時才剪枝
-            if (currentCost + estimatedMinCost > minCost + 5) {
-                prunedCombinations++;
-                return;
-            }
-            
-            // 選擇策略：嘗試所有能覆蓋未覆蓋項目的PI（確保找到所有解）
-            for (let i = startIndex; i < availablePIs.length; i++) {
-                const pi = availablePIs[i];
-                const piCost = allPIsByPattern.get(pi).cost;
-                
-                // 檢查這個PI是否能覆蓋任何未覆蓋的項目
-                let canCoverSomething = false;
-                uncoveredTerms.forEach(term => {
-                    if (term.includes(pi)) {
-                        canCoverSomething = true;
-                    }
-                });
-                
-                if (canCoverSomething && currentCost + piCost < minCost) {
-                    currentSolution.push(pi);
-                    
-                    // 遞歸搜索，從下一個PI開始以避免重複組合
-                    backtrackSearch(currentSolution, currentCost + piCost, availablePIs, i + 1);
-                    
-                    currentSolution.pop();
-                }
-            }
-        };
-        
-        console.log('開始成本剪枝搜索...');
-        const startTime = Date.now();
-        
-        // 使用傳統的Patrick Method搜索算法，支持多重解，並傳入函數信息
-        const searchResult = this.searchPatrickSolutions(patrickTerms, allPIsByPattern, normalizedMinterms);
-        
-        const endTime = Date.now();
-        const searchTime = endTime - startTime;
-        
-        this.calculationSteps[2].details.push(`搜索完成，耗時: ${searchTime}ms`);
-        this.calculationSteps[2].details.push(`檢查組合數: ${searchResult.checkedCombinations}`);
-        this.calculationSteps[2].details.push(`剪枝組合數: ${searchResult.prunedCombinations}`);
-        this.calculationSteps[2].details.push(`找到 ${searchResult.solutions.length} 個最佳解，最小成本: ${searchResult.minCost}`);
-        
-        searchResult.solutions.forEach((sol, index) => {
-            this.calculationSteps[2].details.push(`解${index + 1}: ${sol.join(', ')} (成本: ${searchResult.minCost})`);
-        });
-        
-        console.log(`成本剪枝完成: 檢查${searchResult.checkedCombinations}個組合, 剪枝${searchResult.prunedCombinations}個, 耗時${searchTime}ms`);
-        
-        optimalSolutions = searchResult.solutions;
-        
-        return optimalSolutions;
-    }
-    
-    /**
-     * 傳統Patrick Method搜索，支持多重解
-     */
-    searchPatrickSolutions(patrickTerms, allPIsByPattern, normalizedMinterms = null) {
-        const allPIPatterns = Array.from(allPIsByPattern.keys());
-        const numPIs = allPIPatterns.length;
-        
-        console.log(`開始Patrick Method搜索，PI數量: ${numPIs}`);
-        
-        // 根據PI數量選擇不同的策略
-        if (numPIs <= 20) {
-            console.log("使用窮舉搜索");
-            // 使用窮舉搜索，傳入函數信息以進行三階段成本計算
-            const result = this.solveWithExhaustiveSearch({ 
-                ...Object.fromEntries(patrickTerms.map((term, i) => [i, term]))
-            }, allPIsByPattern, normalizedMinterms);
-            
-            return {
-                solutions: result,
-                minCost: result.length > 0 ? this.calculateSolutionCost(result[0], allPIsByPattern) : Infinity,
-                checkedCombinations: 0,
-                prunedCombinations: 0
-            };
-        } else {
-            console.log("使用回溯搜索");
-            // 直接使用回溯搜索，避免遞歸調用
-            return this.backtrackSearchDirect(patrickTerms, allPIsByPattern);
-        }
-    }
-    
-    /**
-     * 直接回溯搜索，避免遞歸調用問題
-     * 分兩階段：先找最小成本，再找所有相同成本的解
-     */
-    backtrackSearchDirect(patrickTerms, allPIsByPattern) {
-        const allPIPatterns = Array.from(allPIsByPattern.keys());
-        let minCost = Infinity;
-        let optimalSolutions = [];
-        let checkedCombinations = 0;
-        let prunedCombinations = 0;
-        
-        const isValidCover = (solution) => {
-            return patrickTerms.every(term => term.some(pi => solution.includes(pi)));
-        };
-        
-        // 第一階段：找到最小成本
-        const findMinCost = (currentSolution, currentCost, startIndex = 0) => {
-            // 早期剪枝：如果當前成本已經超過最小成本
-            if (currentCost >= minCost) {
-                prunedCombinations++;
-                return;
-            }
-            
-            // 檢查當前解是否有效
-            if (isValidCover(currentSolution)) {
-                checkedCombinations++;
-                
-                if (currentCost < minCost) {
-                    minCost = currentCost;
-                    console.log(`當前最小成本: ${minCost}`);
-                }
-                return;
-            }
-            
-            // 嘗試添加更多PI
-            for (let i = startIndex; i < allPIPatterns.length; i++) {
-                const pattern = allPIPatterns[i];
-                if (!currentSolution.includes(pattern)) {
-                    const piCost = allPIsByPattern.get(pattern).cost;
-                    const newCost = currentCost + piCost;
-                    
-                    // 早期剪枝
-                    if (newCost < minCost) {
-                        currentSolution.push(pattern);
-                        findMinCost(currentSolution, newCost, i + 1);
-                        currentSolution.pop();
-                    } else {
-                        prunedCombinations++;
-                    }
-                }
-            }
-        };
-        
-        // 第二階段：找到所有最小成本的解
-        const findAllOptimalSolutions = (currentSolution, currentCost, startIndex = 0) => {
-            // 如果成本超過最小成本，剪枝
-            if (currentCost > minCost) {
-                return;
-            }
-            
-            // 檢查當前解是否有效
-            if (isValidCover(currentSolution)) {
-                if (currentCost === minCost) {
-                    // 檢查是否已經存在相同的解
-                    const solutionStr = currentSolution.slice().sort().join(',');
-                    const exists = optimalSolutions.some(sol => 
-                        sol.slice().sort().join(',') === solutionStr
-                    );
-                    if (!exists) {
-                        optimalSolutions.push(currentSolution.slice());
-                    }
-                }
-                return;
-            }
-            
-            // 嘗試添加更多PI
-            for (let i = startIndex; i < allPIPatterns.length; i++) {
-                const pattern = allPIPatterns[i];
-                if (!currentSolution.includes(pattern)) {
-                    const piCost = allPIsByPattern.get(pattern).cost;
-                    const newCost = currentCost + piCost;
-                    
-                    // 只搜索不超過最小成本的組合
-                    if (newCost <= minCost) {
-                        currentSolution.push(pattern);
-                        findAllOptimalSolutions(currentSolution, newCost, i + 1);
-                        currentSolution.pop();
-                    }
-                }
-            }
-        };
-        
-        console.log("第一階段：尋找最小成本...");
-        // 第一階段：找最小成本
-        findMinCost([], 0, 0);
-        
-        console.log(`第二階段：尋找所有成本為 ${minCost} 的解...`);
-        // 第二階段：找所有最小成本的解
-        findAllOptimalSolutions([], 0, 0);
-        
-        console.log(`\n搜索完成!`);
-        console.log(`找到 ${optimalSolutions.length} 個最佳解，最小成本: ${minCost}`);
-        optimalSolutions.forEach((sol, index) => {
-            const algebraic = sol.map(pattern => this.convertPatternToAlgebraic(pattern)).join(' + ');
-            console.log(`解${index + 1}: F = ${algebraic}`);
-        });
-        
-        return {
-            solutions: optimalSolutions,
-            minCost: minCost,
-            checkedCombinations: checkedCombinations,
-            prunedCombinations: prunedCombinations
-        };
-    }
-    
-    /**
-     * 窮舉搜索（僅用於小問題）- 使用三階段成本計算進行剪枝
-     */
-    solveWithExhaustiveSearch(coverageTable, allPIsByPattern, normalizedMinterms = null) {
-        const patrickTerms = Object.values(coverageTable);
-        const allPIPatterns = Array.from(allPIsByPattern.keys());
-        const numPIs = allPIPatterns.length;
-        const maxCombinations = Math.pow(2, numPIs);
-        
-        let minCost = Infinity;
-        let minPICount = Infinity;
-        let optimalSolutions = [];
-        let prunedCombinations = 0;
-        let stage1PrunedCombinations = 0;
-        let stage3PrunedCombinations = 0;
-        let totalCombinations = 0;
-        let validCombinations = 0;
-        let threeStageCalculations = 0;
-        
-        console.log(`開始Patrick Method搜索...`);
-        
-        for (let combination = 1; combination < maxCombinations; combination++) {
-            totalCombinations++;
-            const selectedPIs = [];
-            
-            // 收集這個組合包含的PI
-            for (let i = 0; i < numPIs; i++) {
-                if (combination & (1 << i)) {
-                    const pattern = allPIPatterns[i];
-                    selectedPIs.push(pattern);
-                }
-            }
-            
-            // 檢查是否覆蓋所有required terms
-            let isValidCover = true;
-            for (let termIndex = 0; termIndex < patrickTerms.length; termIndex++) {
-                const term = patrickTerms[termIndex];
-                const isCovered = term.some(pi => selectedPIs.includes(pi));
-                if (!isCovered) {
-                    isValidCover = false;
-                    break;
-                }
-            }
-            
-            // 如果不是有效覆蓋，跳過
-            if (!isValidCover) {
-                continue;
-            }
-            
-            // 有效覆蓋，檢查是否為新的最小成本
-            validCombinations++;
-            
-            // 第一層剪枝：使用Stage 1成本進行快速剪枝
-            const stage1Cost = selectedPIs.reduce((total, pattern) => {
-                return total + allPIsByPattern.get(pattern).cost;
-            }, 0);
-            
-            // 如果Stage 1成本已經超過當前最小成本，直接剪枝
-            if (minCost < Infinity && stage1Cost > minCost) {
-                stage1PrunedCombinations++;
-                prunedCombinations++;
-                continue;
-            }
-            
-            // 第二層：計算完整三階段成本（只對通過第一層剪枝的組合）
-            let finalCost;
-            if (normalizedMinterms) {
-                // 使用三階段成本計算
-                threeStageCalculations++;
-                finalCost = this.calculateThreeStagesCost(selectedPIs, normalizedMinterms, allPIsByPattern);
-            } else {
-                // 回退到第一階段成本計算
-                finalCost = stage1Cost;
-            }
-            
-            // 第三層剪枝：使用三階段成本進行最終剪枝
-            if (minCost < Infinity && finalCost > minCost) {
-                stage3PrunedCombinations++;
-                prunedCombinations++;
-                continue;
-            }
-            
-            const piCount = selectedPIs.length;
-            
-            if (finalCost < minCost || (finalCost === minCost && piCount < minPICount)) {
-                // 找到更優解（成本更低，或成本相同但PI數量更少）
-                minCost = finalCost;
-                minPICount = piCount;
-                optimalSolutions = [selectedPIs.slice()];
-                console.log(`當前最佳解: 成本=${minCost}, PI數量=${minPICount}`);
-            } else if (finalCost === minCost && piCount === minPICount) {
-                // 找到相同成本且相同PI數量的解
-                optimalSolutions.push(selectedPIs.slice());
-            }
-        }
-        
-        console.log(`\n搜索完成!`);
-        console.log(`總組合數: ${totalCombinations}, 有效組合: ${validCombinations}, 剪枝組合: ${prunedCombinations}`);
-        console.log(`剪枝詳情: Stage1剪枝=${stage1PrunedCombinations}, Stage3剪枝=${stage3PrunedCombinations}`);
-        console.log(`三階段計算次數: ${threeStageCalculations} (節省: ${validCombinations - threeStageCalculations})`);
-        console.log(`找到 ${optimalSolutions.length} 個最佳解，最小成本: ${minCost}，最少PI數量: ${minPICount}`);
-        optimalSolutions.forEach((sol, index) => {
-            const algebraic = sol.map(pattern => this.convertPatternToAlgebraic(pattern)).join(' + ');
-            console.log(`解${index + 1}: F = ${algebraic} (PI數量: ${sol.length})`);
-        });
-        
-        this.calculationSteps[2].details.push(`找到 ${optimalSolutions.length} 個最佳解，最小成本: ${minCost}，最少PI數量: ${minPICount}`);
-        optimalSolutions.forEach((sol, index) => {
-            this.calculationSteps[2].details.push(`解${index + 1}: ${sol.join(', ')} (成本: ${minCost}, PI數量: ${sol.length})`);
-        });
-        
-        return optimalSolutions;
-    }
-
-    /**
-     * 計算三階段Patrick Method成本
-     * Stage 1: 基本PI生成
-     * Stage 2: 冗餘移除 
-     * Stage 3: 共享成本計算
-     */
-    calculateThreeStagesCost(selectedPIs, normalizedMinterms, allPIsByPattern) {
-        // Stage 1: 基本成本（PI選擇成本）
-        const stage1Cost = selectedPIs.reduce((total, pattern) => {
-            return total + allPIsByPattern.get(pattern).cost;
-        }, 0);
-        
-        // Stage 2: 為每個函數進行冗餘移除
-        const stage2Solutions = {};
-        
-        Object.entries(normalizedMinterms).forEach(([funcName, minterms]) => {
-            // 找出適用於此函數的PI
-            const functionPIs = [];
-            selectedPIs.forEach(pattern => {
-                const piInfo = allPIsByPattern.get(pattern);
-                if (piInfo && piInfo.usedBy.includes(funcName)) {
-                    const coveredMinterms = piInfo.minterms.filter(m => minterms.includes(m));
-                    if (coveredMinterms.length > 0) {
-                        functionPIs.push({
-                            pattern: pattern,
-                            algebraic: this.convertPatternToAlgebraic(pattern),
-                            minterms: coveredMinterms,
-                            cost: piInfo.cost
-                        });
-                    }
-                }
-            });
-            
-            if (functionPIs.length > 0) {
-                // 進行冗餘移除（簡化版）
-                const optimizedPIs = this.removeRedundantPIsForStage2(functionPIs, minterms);
-                stage2Solutions[funcName] = optimizedPIs;
-            }
-        });
-        
-        // 💾 保存Stage 2結果到實例變數，供後續使用
-        const stage2Key = [...selectedPIs].sort().join(',');
-        if (!this._stage2Cache) {
-            this._stage2Cache = new Map();
-        }
-        this._stage2Cache.set(stage2Key, stage2Solutions);
-        
-        // Stage 3: 計算共享成本
-        const piUsageMap = new Map();
-        
-        // 統計每個PI的使用次數
-        Object.values(stage2Solutions).forEach(funcPIs => {
-            funcPIs.forEach(pi => {
-                if (piUsageMap.has(pi.pattern)) {
-                    piUsageMap.get(pi.pattern).usageCount++;
-                } else {
-                    piUsageMap.set(pi.pattern, {
-                        pattern: pi.pattern,
-                        baseCost: pi.cost,
-                        usageCount: 1
-                    });
-                }
-            });
-        });
-        
-        // 計算共享成本：shared_cost = base_cost + (usage_count - 1)
-        let stage3TotalCost = 0;
-        piUsageMap.forEach((piInfo, pattern) => {
-            const sharedCost = piInfo.baseCost + (piInfo.usageCount - 1);
-            stage3TotalCost += sharedCost;
-        });
-        
-        // 合併輸出一行，包含PI數量
-        console.log(`Stage 1: ${stage1Cost} Stage 3: ${stage3TotalCost} 🎯 組合: [${selectedPIs.join(', ')}] PI數量: ${selectedPIs.length}`);
-        
-        return stage3TotalCost;
-    }
-
-    /**
-     * 通用的冗餘PI移除方法（別名）
-     */
-    removeRedundantPIs(functionPIs, targetMinterms) {
-        return this.removeRedundantPIsForStage2(functionPIs, targetMinterms);
-    }
-
-    /**
-     * Stage 2 專用的冗餘PI移除（改進版）
-     * 能夠檢測PI之間的包含關係，如y包含yz'和x'y
-     */
-    removeRedundantPIsForStage2(functionPIs, targetMinterms) {
-        if (functionPIs.length <= 1) {
-            return functionPIs;
-        }
-        
-        // 第一步：移除被其他PI完全包含的PI
-        const nonRedundantPIs = [];
-        
-        functionPIs.forEach(pi => {
-            // 檢查此PI是否被其他任何PI包含
-            const isRedundant = functionPIs.some(otherPI => {
-                if (pi.pattern === otherPI.pattern) return false;
-                
-                // 檢查otherPI是否包含pi的所有minterms
-                const piMintermsInTarget = pi.minterms.filter(m => targetMinterms.includes(m));
-                const otherPIMintermsInTarget = otherPI.minterms.filter(m => targetMinterms.includes(m));
-                
-                // 如果otherPI包含pi的所有目標minterms且成本更低或相等，則pi是冗餘的
-                const isIncluded = piMintermsInTarget.every(m => otherPIMintermsInTarget.includes(m));
-                const isBetterOrEqual = otherPI.cost <= pi.cost;
-                
-                return isIncluded && isBetterOrEqual;
-            });
-            
-            if (!isRedundant) {
-                nonRedundantPIs.push(pi);
-            }
-        });
-        
-        // 第二步：找Essential PIs
-        const essentialPIs = [];
-        const remainingMinterms = new Set(targetMinterms);
-        
-        targetMinterms.forEach(minterm => {
-            const coveringPIs = nonRedundantPIs.filter(pi => pi.minterms.includes(minterm));
-            if (coveringPIs.length === 1) {
-                const essentialPI = coveringPIs[0];
-                if (!essentialPIs.find(pi => pi.pattern === essentialPI.pattern)) {
-                    essentialPIs.push(essentialPI);
-                    essentialPI.minterms.forEach(m => {
-                        if (targetMinterms.includes(m)) {
-                            remainingMinterms.delete(m);
-                        }
-                    });
-                }
-            }
-        });
-        
-        // 第三步：用效率優先的貪婪算法覆蓋剩餘minterms
-        const selectedPIs = [...essentialPIs];
-        const unusedPIs = nonRedundantPIs.filter(pi => 
-            !essentialPIs.find(essential => essential.pattern === pi.pattern)
-        );
-        
-        while (remainingMinterms.size > 0 && unusedPIs.length > 0) {
-            let bestPI = null;
-            let bestEfficiency = 0;
-            
-            unusedPIs.forEach(pi => {
-                const coveredCount = pi.minterms.filter(m => remainingMinterms.has(m)).length;
-                if (coveredCount > 0) {
-                    // 計算效率：覆蓋的minterms數量 / 成本
-                    const efficiency = coveredCount / pi.cost;
-                    if (efficiency > bestEfficiency) {
-                        bestEfficiency = efficiency;
-                        bestPI = pi;
-                    }
-                }
-            });
-            
-            if (bestPI) {
-                selectedPIs.push(bestPI);
-                bestPI.minterms.forEach(m => {
-                    if (remainingMinterms.has(m)) {
-                        remainingMinterms.delete(m);
-                    }
-                });
-                
-                const index = unusedPIs.indexOf(bestPI);
-                if (index > -1) {
-                    unusedPIs.splice(index, 1);
-                }
-            } else {
-                break;
-            }
-        }
-        
-        // 第四步：最終檢查，移除任何剩餘的冗餘PI
-        const finalPIs = [];
-        for (const pi of selectedPIs) {
-            // 檢查移除此PI後是否仍能覆蓋所有minterms
-            const otherPIs = selectedPIs.filter(p => p.pattern !== pi.pattern);
-            const coveredByOthers = new Set();
-            otherPIs.forEach(otherPI => {
-                otherPI.minterms.forEach(m => {
-                    if (targetMinterms.includes(m)) {
-                        coveredByOthers.add(m);
-                    }
-                });
-            });
-            
-            // 如果其他PI不能覆蓋所有目標minterms，則此PI是必要的
-            const isNecessary = targetMinterms.some(m => !coveredByOthers.has(m));
-            if (isNecessary) {
-                finalPIs.push(pi);
-            }
-        }
-        
-        return finalPIs;
-    }
-
-    /**
-     * 貪婪演算法求解 Patrick Method
-     * 使用效率分數（覆蓋數量/成本）選擇最佳的 Prime Implicants
-     * @param {Array} patrickTerms - Patrick 項目陣列
-     * @param {Array} allPIPatterns - 所有 PI 模式陣列
-     * @param {Map} allPIsByPattern - PI 模式對應表
-     * @returns {Array} 選中的 PI 陣列
-     */
-    greedySolution(patrickTerms, allPIPatterns, allPIsByPattern) {
-        const selectedPIs = [];
-        const uncoveredTerms = patrickTerms.map((term, index) => ({ term, index, covered: false }));
-        
-        while (uncoveredTerms.some(t => !t.covered)) {
-            let bestPI = null;
-            let bestScore = -1;
-            
-            // 找到覆蓋最多未覆蓋項且效率最高的 PI
-            allPIPatterns.forEach(pattern => {
-                if (selectedPIs.includes(pattern)) return;
-                
-                let coveredCount = 0;
-                uncoveredTerms.forEach(termInfo => {
-                    if (!termInfo.covered && termInfo.term.includes(pattern)) {
-                        coveredCount++;
-                    }
-                });
-                
-                if (coveredCount > 0) {
-                    const cost = allPIsByPattern.get(pattern).cost;
-                    const score = coveredCount / cost; // 計算效率分數：覆蓋數量除以成本
-                    
-                    if (score > bestScore) {
-                        bestScore = score;
-                        bestPI = pattern;
-                    }
-                }
-            });
-            
-            if (bestPI) {
-                selectedPIs.push(bestPI);
-                
-                // 更新覆蓋狀態，標記被選中 PI 覆蓋的項目
-                uncoveredTerms.forEach(termInfo => {
-                    if (termInfo.term.includes(bestPI)) {
-                        termInfo.covered = true;
-                    }
-                });
-            } else {
-                break; // 無法找到更多覆蓋項目，結束迴圈
-            }
-        }
-        
-        return selectedPIs;
-    }
-    
-    /**
-     * 局部最佳化演算法
-     * 嘗試移除解決方案中不必要的 Prime Implicants，以降低總成本
-     * @param {Array} solution - 當前解決方案
-     * @param {Array} patrickTerms - Patrick 項目陣列
-     * @param {Array} allPIPatterns - 所有 PI 模式陣列
-     * @param {Map} allPIsByPattern - PI 模式對應表
-     * @returns {Array} 最佳化後的解決方案
-     */
-    localOptimize(solution, patrickTerms, allPIPatterns, allPIsByPattern) {
-        const optimized = solution.slice();
-        
-        // 從後往前嘗試移除不必要的 PI
-        for (let i = optimized.length - 1; i >= 0; i--) {
-            const testSolution = optimized.slice();
-            testSolution.splice(i, 1);
-            
-            // 檢查移除該 PI 後解決方案是否仍然有效
-            if (this.isValidSolution(testSolution, patrickTerms)) {
-                optimized.splice(i, 1);
-            }
-        }
-        
-        return optimized;
-    }
-    
-        /**
-     * 檢查解決方案是否有效
-     * 驗證每個 Patrick 項目都至少被一個選中的 PI 覆蓋
-     * @param {Array} solution - 解決方案陣列
-     * @param {Array} patrickTerms - Patrick 項目陣列
-     * @returns {boolean} 解決方案是否有效
-     */
-    isValidSolution(solution, patrickTerms) {
-        return patrickTerms.every(term => term.some(pi => solution.includes(pi)));
-    }
-
-    /**
-     * 計算解決方案的總成本
-     * 累加所有選中 Prime Implicants 的成本
-     * @param {Array} solution - 解決方案陣列
-     * @param {Map} allPIsByPattern - PI 模式對應表
-     * @returns {number} 總成本
-     */
-    calculateSolutionCost(solution, allPIsByPattern) {
-        return solution.reduce((total, pattern) => {
-            return total + allPIsByPattern.get(pattern).cost;
-        }, 0);
-    }
-
-    /**
-     * 從聯合解決方案生成系統解決方案
-     * 將聯合最佳化的結果分解為各個函數的具體解決方案
-     * @param {Array} jointSolutions - 聯合解決方案陣列
-     * @param {Object} normalizedMinterms - 標準化的 minterms 對應表
-     * @returns {Array} 系統解決方案陣列
-     */
-    generateSystemSolutionsFromJoint(jointSolutions, normalizedMinterms) {
-        const systemSolutions = [];
-        
-        jointSolutions.forEach((solution, solutionIndex) => {
-            console.log(`\n生成系統解決方案 ${solutionIndex + 1}`);
-            const systemSolution = {};
-            
-            Object.entries(normalizedMinterms).forEach(([funcName, minterms]) => {
-                console.log(`\n處理函數 ${funcName}，目標 minterms: [${minterms.join(',')}]`);
-                const functionPIs = [];
-                
-                solution.forEach(pattern => {
-                    // 檢查這個 PI 是否覆蓋這個函數的 minterms
-                    const piInfo = this.getAllPIsByPattern().get(pattern);
-                    if (piInfo && piInfo.usedBy.includes(funcName)) {
-                        const coveredMinterms = piInfo.minterms.filter(m => minterms.includes(m));
-                        if (coveredMinterms.length > 0) {
-                            functionPIs.push({
-                                pattern: pattern,
-                                algebraic: this.convertPatternToAlgebraic(pattern),
-                                minterms: coveredMinterms,
-                                cost: piInfo.cost
-                            });
-                        }
-                    }
-                });
-                
-                if (functionPIs.length > 0) {
-                    console.log(`${funcName} 初始 PI 數量: ${functionPIs.length}`);
-                    
-                    // 應用 Stage 2 的冗餘移除邏輯
-                    const optimizedPIs = this.removeRedundantPIsForStage2(functionPIs, minterms);
-                    console.log(`${funcName} Stage 2 最佳化後 PI 數量: ${optimizedPIs.length}`);
-                    
-                    systemSolution[funcName] = {
-                        pis: optimizedPIs,
-                        expression: optimizedPIs.map(pi => pi.algebraic).join(' + '),
-                        cost: optimizedPIs.reduce((sum, pi) => sum + pi.cost, 0)
-                    };
-                    
-                    console.log(`${funcName} 最終表達式: ${systemSolution[funcName].expression}`);
-                }
-            });
-            
-            systemSolutions.push(systemSolution);
-        });
-        
-        return systemSolutions;
-    }
-
-    /**
-     * 獲取所有 Prime Implicants 的引用（用於聯合解決方案）
-     * @returns {Map} PI 模式對應表
-     */
-    getAllPIsByPattern() {
-        return this._allPIsByPattern || new Map();
-    }
-
-    /**
-     * 設置所有 Prime Implicants 的引用
-     * @param {Map} allPIsByPattern - PI 模式對應表
-     */
-    setAllPIsByPattern(allPIsByPattern) {
-        this._allPIsByPattern = allPIsByPattern;
-    }
-
-
-}
-
-/**
- * 多輸出 Patrick Method 擴展類
- * 這是對外的主要接口類，與網頁版本相容
- * 提供簡化的調用接口，內部調用父類的完整實現
- */
-class MultipleOutputPatrick extends PatrickMethod {
-    constructor() {
-        super();
-    }
-
-    /**
-     * 執行多輸出最佳化的主要方法
-     * 這是對外的主要接口，與網頁版本相容
-     * @param {Object} mintermsByFunction - 各函數的 minterms 對應表
-     * @param {number} numVars - 變數數量  
-     * @param {Array} dontCares - Don't Care 項目陣列
-     * @returns {Object} 最佳化結果
-     */
-    executeMultipleOutput(mintermsByFunction, numVars, dontCares = []) {
-        return super.executeMultipleOutput(mintermsByFunction, numVars, dontCares);
-    }
-}
-
-// ==================== 模組導出設定 ====================
-// 如果在瀏覽器環境中，將類別加到全域作用域
-if (typeof window !== 'undefined') {
-    window.PatrickMethod = PatrickMethod;
-    window.MultipleOutputPatrick = MultipleOutputPatrick;
-}
-
-// 如果在 Node.js 環境中，導出模組
-if (typeof module !== 'undefined' && module.exports) {
-    module.exports = { PatrickMethod, MultipleOutputPatrick };
-}
\ No newline at end of file
diff --git a/playwright.config.ts b/playwright.config.ts
new file mode 100644
index 0000000..b9ada01
--- /dev/null
+++ b/playwright.config.ts
@@ -0,0 +1,25 @@
+import { defineConfig, devices } from '@playwright/test';
+
+export default defineConfig({
+  testDir: './tests/e2e',
+  fullyParallel: true,
+  forbidOnly: Boolean(process.env.CI),
+  retries: process.env.CI ? 2 : 0,
+  workers: process.env.CI ? 1 : undefined,
+  reporter: 'html',
+  use: {
+    baseURL: 'http://127.0.0.1:4173/boolean-function-minimizer/',
+    trace: 'on-first-retry'
+  },
+  projects: [
+    {
+      name: 'chromium',
+      use: { ...devices['Desktop Chrome'] }
+    }
+  ],
+  webServer: {
+    command: 'npm run build && npm run preview -- --host 127.0.0.1',
+    url: 'http://127.0.0.1:4173/boolean-function-minimizer/',
+    reuseExistingServer: !process.env.CI
+  }
+});
diff --git a/public/icon.svg b/public/icon.svg
new file mode 100644
index 0000000..99dcc52
--- /dev/null
+++ b/public/icon.svg
@@ -0,0 +1,6 @@
+<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512">
+  <rect width="512" height="512" rx="96" fill="#17223b"/>
+  <path d="M116 144h112v76H116zM284 144h112v76H284zM116 292h112v76H116zM284 292h112v76H284z" fill="#fffdf8"/>
+  <path d="M228 182h56M228 330h56M172 220v72M340 220v72" stroke="#f05a3c" stroke-width="24"/>
+  <circle cx="256" cy="256" r="30" fill="#087f78"/>
+</svg>
diff --git a/public/manifest.webmanifest b/public/manifest.webmanifest
new file mode 100644
index 0000000..ae4357f
--- /dev/null
+++ b/public/manifest.webmanifest
@@ -0,0 +1,19 @@
+{
+  "name": "Boolean Logic Minimizer",
+  "short_name": "Logic Minimizer",
+  "description": "可驗證的 Quine–McCluskey 與 Petrick 布林函數最小化工具。",
+  "lang": "zh-Hant",
+  "start_url": "./",
+  "scope": "./",
+  "display": "standalone",
+  "background_color": "#f3f0e9",
+  "theme_color": "#17223b",
+  "icons": [
+    {
+      "src": "icon.svg",
+      "sizes": "any",
+      "type": "image/svg+xml",
+      "purpose": "any maskable"
+    }
+  ]
+}
diff --git a/public/social-preview.png b/public/social-preview.png
new file mode 100644
index 0000000..929fe3c
Binary files /dev/null and b/public/social-preview.png differ
diff --git a/public/sw.js b/public/sw.js
new file mode 100644
index 0000000..6388aeb
--- /dev/null
+++ b/public/sw.js
@@ -0,0 +1,58 @@
+const CACHE_PREFIX = 'boolean-minimizer';
+const CACHE_VERSION = 'v2';
+const CACHE_NAME = `${CACHE_PREFIX}-${CACHE_VERSION}`;
+const APP_SHELL = ['./', './index.html', './icon.svg', './manifest.webmanifest'];
+
+self.addEventListener('install', (event) => {
+  event.waitUntil(caches.open(CACHE_NAME).then((cache) => cache.addAll(APP_SHELL)));
+  self.skipWaiting();
+});
+
+self.addEventListener('activate', (event) => {
+  event.waitUntil(
+    caches
+      .keys()
+      .then((names) =>
+        Promise.all(
+          names
+            .filter((name) => name.startsWith(CACHE_PREFIX) && name !== CACHE_NAME)
+            .map((name) => caches.delete(name))
+        )
+      )
+      .then(() => self.clients.claim())
+  );
+});
+
+self.addEventListener('fetch', (event) => {
+  const request = event.request;
+  const url = new URL(request.url);
+  if (request.method !== 'GET' || url.origin !== self.location.origin) {
+    return;
+  }
+
+  if (request.mode === 'navigate') {
+    event.respondWith(
+      fetch(request)
+        .then((response) => {
+          const copy = response.clone();
+          void caches.open(CACHE_NAME).then((cache) => cache.put('./index.html', copy));
+          return response;
+        })
+        .catch(() => caches.match('./index.html'))
+    );
+    return;
+  }
+
+  event.respondWith(
+    caches.match(request).then((cached) => {
+      const network = fetch(request).then((response) => {
+        if (response.ok) {
+          const copy = response.clone();
+          void caches.open(CACHE_NAME).then((cache) => cache.put(request, copy));
+        }
+        return response;
+      });
+      return cached ?? network;
+    })
+  );
+});
diff --git a/scripts/capture-preview.mjs b/scripts/capture-preview.mjs
new file mode 100644
index 0000000..03f9ccb
--- /dev/null
+++ b/scripts/capture-preview.mjs
@@ -0,0 +1,18 @@
+import { chromium } from '@playwright/test';
+
+const browser = await chromium.launch({ headless: true });
+const page = await browser.newPage({
+  viewport: { width: 1280, height: 640 },
+  deviceScaleFactor: 1
+});
+
+await page.goto('http://127.0.0.1:5173/boolean-function-minimizer/');
+await page.getByRole('button', { name: '單輸出' }).click();
+await page.getByRole('button', { name: '執行 Exact Minimization' }).click();
+await page.getByText('F1 = C').waitFor();
+await page.evaluate(() => {
+  document.documentElement.style.zoom = '0.75';
+  window.scrollTo(0, 0);
+});
+await page.screenshot({ path: 'public/social-preview.png' });
+await browser.close();
diff --git a/src/core/cube.ts b/src/core/cube.ts
new file mode 100644
index 0000000..9087b2f
--- /dev/null
+++ b/src/core/cube.ts
@@ -0,0 +1,61 @@
+import type { PrimeImplicant } from './model';
+
+export function expandPattern(pattern: string): number[] {
+  let values = [0];
+
+  for (const bit of pattern) {
+    if (bit === '-') {
+      values = values.flatMap((value) => [value << 1, (value << 1) | 1]);
+    } else {
+      const parsedBit = bit === '1' ? 1 : 0;
+      values = values.map((value) => (value << 1) | parsedBit);
+    }
+  }
+
+  return values;
+}
+
+export function literalCount(pattern: string): number {
+  return [...pattern].filter((bit) => bit !== '-').length;
+}
+
+export function productTermCost(pattern: string): number {
+  const literals = literalCount(pattern);
+  return literals <= 1 ? 1 : literals + 1;
+}
+
+export function toPrimeImplicant(pattern: string, onSet: ReadonlySet<number>): PrimeImplicant {
+  const coveredMinterms = expandPattern(pattern)
+    .filter((minterm) => onSet.has(minterm))
+    .sort((left, right) => left - right);
+
+  return {
+    pattern,
+    coveredMinterms,
+    literalCount: literalCount(pattern),
+    cost: productTermCost(pattern)
+  };
+}
+
+export function patternToExpression(pattern: string, variables: readonly string[]): string {
+  const terms: string[] = [];
+
+  for (let index = 0; index < pattern.length; index += 1) {
+    const bit = pattern[index];
+    const variable = variables[index];
+
+    if (variable === undefined || bit === '-') {
+      continue;
+    }
+
+    terms.push(bit === '1' ? variable : `${variable}'`);
+  }
+
+  return terms.length === 0 ? '1' : terms.join('');
+}
+
+export function covers(pattern: string, minterm: number, variableCount: number): boolean {
+  const bits = minterm.toString(2).padStart(variableCount, '0');
+
+  return [...pattern].every((bit, index) => bit === '-' || bit === bits[index]);
+}
diff --git a/src/core/index.ts b/src/core/index.ts
new file mode 100644
index 0000000..5fe3482
--- /dev/null
+++ b/src/core/index.ts
@@ -0,0 +1,6 @@
+export * from './cube';
+export * from './model';
+export * from './petrick';
+export * from './quine-mccluskey';
+export * from './solver';
+export * from './validation';
diff --git a/src/core/model.ts b/src/core/model.ts
new file mode 100644
index 0000000..091aa85
--- /dev/null
+++ b/src/core/model.ts
@@ -0,0 +1,82 @@
+export type InputMode = 'minterms' | 'primes';
+
+export interface RawFunctionInput {
+  name: string;
+  minterms: string;
+  dontCares: string;
+  primeImplicants?: string;
+}
+
+export interface RawProblemInput {
+  variables: string;
+  mode: InputMode;
+  functions: RawFunctionInput[];
+}
+
+export interface LogicFunction {
+  name: string;
+  minterms: number[];
+  dontCares: number[];
+  providedPrimeImplicants?: string[];
+}
+
+export interface ProblemSpec {
+  variables: string[];
+  mode: InputMode;
+  functions: LogicFunction[];
+}
+
+export type ValidationCode =
+  | 'variables-empty'
+  | 'variables-too-many'
+  | 'variable-invalid'
+  | 'variable-duplicate'
+  | 'functions-empty'
+  | 'functions-too-many'
+  | 'function-name-invalid'
+  | 'function-name-duplicate'
+  | 'integer-invalid'
+  | 'integer-duplicate'
+  | 'minterm-out-of-range'
+  | 'dont-care-out-of-range'
+  | 'set-overlap'
+  | 'prime-required'
+  | 'prime-invalid'
+  | 'prime-width'
+  | 'prime-off-set'
+  | 'prime-uncovered-minterm';
+
+export interface ValidationIssue {
+  code: ValidationCode;
+  path: string;
+  message: string;
+}
+
+export type ValidationResult<T> = { ok: true; value: T } | { ok: false; issues: ValidationIssue[] };
+
+export interface PrimeImplicant {
+  pattern: string;
+  coveredMinterms: number[];
+  literalCount: number;
+  cost: number;
+}
+
+export interface FunctionSolution {
+  name: string;
+  expression: string;
+  patterns: string[];
+  individualCost: number;
+}
+
+export interface SolverResult {
+  guarantee: 'exact-prime-cover';
+  variables: string[];
+  functions: FunctionSolution[];
+  primeImplicants: Record<string, PrimeImplicant[]>;
+  sharedPatterns: Array<{ pattern: string; functions: string[] }>;
+  totalSharedCost: number;
+  targetCount: number;
+  candidateEdgeCount: number;
+  elapsedMs: number;
+  costModel: string;
+}
diff --git a/src/core/petrick.ts b/src/core/petrick.ts
new file mode 100644
index 0000000..998a7ea
--- /dev/null
+++ b/src/core/petrick.ts
@@ -0,0 +1,214 @@
+import { patternToExpression } from './cube';
+import type { FunctionSolution, PrimeImplicant, ProblemSpec, SolverResult } from './model';
+
+interface CandidateEdge {
+  functionIndex: number;
+  functionName: string;
+  pattern: string;
+  baseCost: number;
+  covers: string[];
+}
+
+interface SearchSolution {
+  edges: number[];
+  cost: number;
+}
+
+const MAX_CANDIDATE_EDGES = 28;
+const MAX_TARGETS = 64;
+const MAX_EQUAL_SOLUTIONS = 20;
+
+export class ProblemTooLargeError extends Error {
+  constructor(message: string) {
+    super(message);
+    this.name = 'ProblemTooLargeError';
+  }
+}
+
+function targetKey(functionIndex: number, minterm: number): string {
+  return `${functionIndex}:${minterm}`;
+}
+
+function buildEdges(
+  problem: ProblemSpec,
+  primeImplicants: Record<string, PrimeImplicant[]>
+): { edges: CandidateEdge[]; targets: string[] } {
+  const targets = problem.functions.flatMap((logicFunction, functionIndex) =>
+    logicFunction.minterms.map((minterm) => targetKey(functionIndex, minterm))
+  );
+  const edges = problem.functions.flatMap((logicFunction, functionIndex) =>
+    (primeImplicants[logicFunction.name] ?? []).map<CandidateEdge>((prime) => ({
+      functionIndex,
+      functionName: logicFunction.name,
+      pattern: prime.pattern,
+      baseCost: prime.cost,
+      covers: prime.coveredMinterms.map((minterm) => targetKey(functionIndex, minterm))
+    }))
+  );
+
+  return { edges, targets };
+}
+
+function solveEdges(edges: readonly CandidateEdge[], targets: readonly string[]): SearchSolution {
+  if (targets.length === 0) {
+    return { edges: [], cost: 0 };
+  }
+
+  if (edges.length > MAX_CANDIDATE_EDGES || targets.length > MAX_TARGETS) {
+    throw new ProblemTooLargeError(
+      `Exact mode 的候選連線為 ${edges.length}、目標為 ${targets.length}；上限分別是 ${MAX_CANDIDATE_EDGES} 與 ${MAX_TARGETS}。`
+    );
+  }
+
+  const edgesByTarget = new Map<string, number[]>();
+  targets.forEach((target) => edgesByTarget.set(target, []));
+  edges.forEach((edge, edgeIndex) => {
+    edge.covers.forEach((target) => edgesByTarget.get(target)?.push(edgeIndex));
+  });
+
+  for (const target of targets) {
+    if ((edgesByTarget.get(target) ?? []).length === 0) {
+      throw new Error(`沒有候選 Prime Implicant 可以覆蓋 ${target}。`);
+    }
+  }
+
+  let bestCost = Number.POSITIVE_INFINITY;
+  let bestEdgeCount = Number.POSITIVE_INFINITY;
+  const bestSolutions: SearchSolution[] = [];
+  const selectedEdges = new Set<number>();
+  const usedPatterns = new Map<string, number>();
+  const coveredTargets = new Set<string>();
+
+  const search = (currentCost: number): void => {
+    if (currentCost > bestCost) {
+      return;
+    }
+
+    if (coveredTargets.size === targets.length) {
+      const edgeList = [...selectedEdges].sort((left, right) => left - right);
+      if (currentCost < bestCost || (currentCost === bestCost && edgeList.length < bestEdgeCount)) {
+        bestCost = currentCost;
+        bestEdgeCount = edgeList.length;
+        bestSolutions.length = 0;
+      }
+
+      if (
+        currentCost === bestCost &&
+        edgeList.length === bestEdgeCount &&
+        bestSolutions.length < MAX_EQUAL_SOLUTIONS
+      ) {
+        const signature = edgeList.join(',');
+        if (!bestSolutions.some((solution) => solution.edges.join(',') === signature)) {
+          bestSolutions.push({ edges: edgeList, cost: currentCost });
+        }
+      }
+      return;
+    }
+
+    const uncoveredTarget = targets
+      .filter((target) => !coveredTargets.has(target))
+      .sort(
+        (left, right) =>
+          (edgesByTarget.get(left)?.length ?? 0) - (edgesByTarget.get(right)?.length ?? 0) ||
+          left.localeCompare(right)
+      )[0];
+
+    if (uncoveredTarget === undefined) {
+      return;
+    }
+
+    for (const edgeIndex of edgesByTarget.get(uncoveredTarget) ?? []) {
+      if (selectedEdges.has(edgeIndex)) {
+        continue;
+      }
+
+      const edge = edges[edgeIndex];
+      if (edge === undefined) {
+        continue;
+      }
+
+      const priorUsage = usedPatterns.get(edge.pattern) ?? 0;
+      const incrementalCost = priorUsage === 0 ? edge.baseCost : 1;
+      if (currentCost + incrementalCost > bestCost) {
+        continue;
+      }
+
+      selectedEdges.add(edgeIndex);
+      usedPatterns.set(edge.pattern, priorUsage + 1);
+      const newlyCovered = edge.covers.filter((target) => !coveredTargets.has(target));
+      newlyCovered.forEach((target) => coveredTargets.add(target));
+
+      search(currentCost + incrementalCost);
+
+      newlyCovered.forEach((target) => coveredTargets.delete(target));
+      if (priorUsage === 0) {
+        usedPatterns.delete(edge.pattern);
+      } else {
+        usedPatterns.set(edge.pattern, priorUsage);
+      }
+      selectedEdges.delete(edgeIndex);
+    }
+  };
+
+  search(0);
+
+  const best = bestSolutions[0];
+  if (best === undefined) {
+    throw new Error('找不到完整覆蓋。');
+  }
+  return best;
+}
+
+export function solvePetrickCover(
+  problem: ProblemSpec,
+  primeImplicants: Record<string, PrimeImplicant[]>,
+  startedAt = performance.now()
+): SolverResult {
+  const { edges, targets } = buildEdges(problem, primeImplicants);
+  const best = solveEdges(edges, targets);
+  const selected = best.edges
+    .map((edgeIndex) => edges[edgeIndex])
+    .filter((edge): edge is CandidateEdge => edge !== undefined);
+  const functions: FunctionSolution[] = problem.functions.map((logicFunction, functionIndex) => {
+    const functionEdges = selected.filter((edge) => edge.functionIndex === functionIndex);
+    const patterns = functionEdges.map((edge) => edge.pattern).sort();
+    const expression =
+      patterns.length === 0
+        ? '0'
+        : patterns.map((pattern) => patternToExpression(pattern, problem.variables)).join(' + ');
+
+    return {
+      name: logicFunction.name,
+      expression,
+      patterns,
+      individualCost: functionEdges.reduce((sum, edge) => sum + edge.baseCost, 0)
+    };
+  });
+  const patternFunctions = new Map<string, Set<string>>();
+  selected.forEach((edge) => {
+    const usedBy = patternFunctions.get(edge.pattern) ?? new Set<string>();
+    usedBy.add(edge.functionName);
+    patternFunctions.set(edge.pattern, usedBy);
+  });
+  const sharedPatterns = [...patternFunctions.entries()]
+    .filter(([, functionNames]) => functionNames.size > 1)
+    .map(([pattern, functionNames]) => ({
+      pattern,
+      functions: [...functionNames].sort()
+    }))
+    .sort((left, right) => left.pattern.localeCompare(right.pattern));
+
+  return {
+    guarantee: 'exact-prime-cover',
+    variables: [...problem.variables],
+    functions,
+    primeImplicants,
+    sharedPatterns,
+    totalSharedCost: best.cost,
+    targetCount: targets.length,
+    candidateEdgeCount: edges.length,
+    elapsedMs: performance.now() - startedAt,
+    costModel:
+      '在各輸出 Prime Implicant 候選集合內精確求解；product term 首次使用成本為 literal 數（多 literal 再加 1），跨輸出重用每次加 1。'
+  };
+}
diff --git a/src/core/quine-mccluskey.ts b/src/core/quine-mccluskey.ts
new file mode 100644
index 0000000..0ddba3f
--- /dev/null
+++ b/src/core/quine-mccluskey.ts
@@ -0,0 +1,118 @@
+import { expandPattern, toPrimeImplicant } from './cube';
+import type { PrimeImplicant } from './model';
+
+interface WorkingCube {
+  pattern: string;
+  sourceTerms: Set<number>;
+}
+
+function combinePatterns(left: string, right: string): string | null {
+  let differenceIndex = -1;
+
+  for (let index = 0; index < left.length; index += 1) {
+    const leftBit = left[index];
+    const rightBit = right[index];
+
+    if (leftBit === rightBit) {
+      continue;
+    }
+
+    if (
+      differenceIndex !== -1 ||
+      leftBit === '-' ||
+      rightBit === '-' ||
+      !((leftBit === '0' && rightBit === '1') || (leftBit === '1' && rightBit === '0'))
+    ) {
+      return null;
+    }
+
+    differenceIndex = index;
+  }
+
+  if (differenceIndex === -1) {
+    return null;
+  }
+
+  return `${left.slice(0, differenceIndex)}-${left.slice(differenceIndex + 1)}`;
+}
+
+function mergeCube(target: Map<string, WorkingCube>, cube: WorkingCube): void {
+  const existing = target.get(cube.pattern);
+  if (existing === undefined) {
+    target.set(cube.pattern, cube);
+    return;
+  }
+
+  cube.sourceTerms.forEach((term) => existing.sourceTerms.add(term));
+}
+
+export function generatePrimeImplicants(
+  minterms: readonly number[],
+  dontCares: readonly number[],
+  variableCount: number
+): PrimeImplicant[] {
+  if (minterms.length === 0) {
+    return [];
+  }
+
+  const onSet = new Set(minterms);
+  const allowedTerms = new Set([...minterms, ...dontCares]);
+  let level = [...allowedTerms]
+    .sort((left, right) => left - right)
+    .map<WorkingCube>((term) => ({
+      pattern: term.toString(2).padStart(variableCount, '0'),
+      sourceTerms: new Set([term])
+    }));
+  const primes = new Map<string, WorkingCube>();
+
+  while (level.length > 0) {
+    const combinedIndexes = new Set<number>();
+    const nextLevel = new Map<string, WorkingCube>();
+
+    for (let leftIndex = 0; leftIndex < level.length; leftIndex += 1) {
+      for (let rightIndex = leftIndex + 1; rightIndex < level.length; rightIndex += 1) {
+        const left = level[leftIndex];
+        const right = level[rightIndex];
+        if (left === undefined || right === undefined) {
+          continue;
+        }
+
+        const combinedPattern = combinePatterns(left.pattern, right.pattern);
+        if (combinedPattern === null) {
+          continue;
+        }
+
+        combinedIndexes.add(leftIndex);
+        combinedIndexes.add(rightIndex);
+        mergeCube(nextLevel, {
+          pattern: combinedPattern,
+          sourceTerms: new Set([...left.sourceTerms, ...right.sourceTerms])
+        });
+      }
+    }
+
+    level.forEach((cube, index) => {
+      if (!combinedIndexes.has(index)) {
+        mergeCube(primes, cube);
+      }
+    });
+
+    level = [...nextLevel.values()];
+  }
+
+  return [...primes.values()]
+    .filter((cube) => {
+      const expanded = expandPattern(cube.pattern);
+      return (
+        expanded.some((minterm) => onSet.has(minterm)) &&
+        expanded.every((minterm) => allowedTerms.has(minterm))
+      );
+    })
+    .map((cube) => toPrimeImplicant(cube.pattern, onSet))
+    .sort(
+      (left, right) =>
+        left.cost - right.cost ||
+        right.coveredMinterms.length - left.coveredMinterms.length ||
+        left.pattern.localeCompare(right.pattern)
+    );
+}
diff --git a/src/core/solver.ts b/src/core/solver.ts
new file mode 100644
index 0000000..4964d55
--- /dev/null
+++ b/src/core/solver.ts
@@ -0,0 +1,24 @@
+import { toPrimeImplicant } from './cube';
+import type { PrimeImplicant, ProblemSpec, SolverResult } from './model';
+import { solvePetrickCover } from './petrick';
+import { generatePrimeImplicants } from './quine-mccluskey';
+
+export function solveProblem(problem: ProblemSpec): SolverResult {
+  const startedAt = performance.now();
+  const primeImplicants: Record<string, PrimeImplicant[]> = {};
+
+  problem.functions.forEach((logicFunction) => {
+    primeImplicants[logicFunction.name] =
+      logicFunction.providedPrimeImplicants === undefined
+        ? generatePrimeImplicants(
+            logicFunction.minterms,
+            logicFunction.dontCares,
+            problem.variables.length
+          )
+        : logicFunction.providedPrimeImplicants.map((pattern) =>
+            toPrimeImplicant(pattern, new Set(logicFunction.minterms))
+          );
+  });
+
+  return solvePetrickCover(problem, primeImplicants, startedAt);
+}
diff --git a/src/core/validation.ts b/src/core/validation.ts
new file mode 100644
index 0000000..422bd9c
--- /dev/null
+++ b/src/core/validation.ts
@@ -0,0 +1,287 @@
+import { expandPattern } from './cube';
+import type {
+  LogicFunction,
+  ProblemSpec,
+  RawProblemInput,
+  ValidationIssue,
+  ValidationResult
+} from './model';
+
+export const MAX_EXACT_VARIABLES = 6;
+export const MAX_FUNCTIONS = 4;
+
+const namePattern = /^\p{L}[\p{L}\p{N}_]*$/u;
+
+function parseVariables(raw: string, issues: ValidationIssue[]): string[] {
+  const trimmed = raw.trim();
+  if (trimmed.length === 0) {
+    issues.push({
+      code: 'variables-empty',
+      path: 'variables',
+      message: '請至少輸入一個變數。'
+    });
+    return [];
+  }
+
+  const variables = (trimmed.includes(',') ? trimmed.split(',') : [...trimmed])
+    .map((value) => value.trim())
+    .filter(Boolean);
+
+  if (variables.length > MAX_EXACT_VARIABLES) {
+    issues.push({
+      code: 'variables-too-many',
+      path: 'variables',
+      message: `Exact mode 最多支援 ${MAX_EXACT_VARIABLES} 個變數。`
+    });
+  }
+
+  const seen = new Set<string>();
+  variables.forEach((variable, index) => {
+    if (!namePattern.test(variable)) {
+      issues.push({
+        code: 'variable-invalid',
+        path: `variables.${index}`,
+        message: `變數「${variable}」必須以字母開頭，且只能包含字母、數字或底線。`
+      });
+    }
+
+    if (seen.has(variable)) {
+      issues.push({
+        code: 'variable-duplicate',
+        path: `variables.${index}`,
+        message: `變數「${variable}」重複。`
+      });
+    }
+    seen.add(variable);
+  });
+
+  return variables;
+}
+
+function parseIntegerList(
+  raw: string,
+  path: string,
+  rangeCode: 'minterm-out-of-range' | 'dont-care-out-of-range',
+  maxValue: number,
+  issues: ValidationIssue[]
+): number[] {
+  const tokens = raw
+    .split(/[\s,]+/)
+    .map((token) => token.trim())
+    .filter(Boolean);
+  const values: number[] = [];
+  const seen = new Set<number>();
+
+  tokens.forEach((token, index) => {
+    if (!/^-?\d+$/.test(token)) {
+      issues.push({
+        code: 'integer-invalid',
+        path: `${path}.${index}`,
+        message: `「${token}」不是整數。`
+      });
+      return;
+    }
+
+    const value = Number(token);
+    if (!Number.isSafeInteger(value)) {
+      issues.push({
+        code: 'integer-invalid',
+        path: `${path}.${index}`,
+        message: `「${token}」超出安全整數範圍。`
+      });
+      return;
+    }
+
+    if (value < 0 || value > maxValue) {
+      issues.push({
+        code: rangeCode,
+        path: `${path}.${index}`,
+        message: `m${value} 超出目前變數可表示的範圍 0–${maxValue}。`
+      });
+      return;
+    }
+
+    if (seen.has(value)) {
+      issues.push({
+        code: 'integer-duplicate',
+        path: `${path}.${index}`,
+        message: `m${value} 重複。`
+      });
+      return;
+    }
+
+    seen.add(value);
+    values.push(value);
+  });
+
+  return values.sort((left, right) => left - right);
+}
+
+function parsePrimeImplicants(
+  raw: string,
+  path: string,
+  variableCount: number,
+  onSet: ReadonlySet<number>,
+  dontCares: ReadonlySet<number>,
+  issues: ValidationIssue[]
+): string[] {
+  const patterns = raw
+    .split(/[\s,]+/)
+    .map((pattern) => pattern.trim())
+    .filter(Boolean);
+
+  if (onSet.size > 0 && patterns.length === 0) {
+    issues.push({
+      code: 'prime-required',
+      path,
+      message: 'Prime Implicants 模式下，每個非空函數至少需要一個 PI。'
+    });
+    return [];
+  }
+
+  const uniquePatterns = [...new Set(patterns)];
+  const allowed = new Set([...onSet, ...dontCares]);
+
+  uniquePatterns.forEach((pattern, index) => {
+    if (!/^[01-]+$/.test(pattern)) {
+      issues.push({
+        code: 'prime-invalid',
+        path: `${path}.${index}`,
+        message: `PI「${pattern}」只能包含 0、1 與 -。`
+      });
+      return;
+    }
+
+    if (pattern.length !== variableCount) {
+      issues.push({
+        code: 'prime-width',
+        path: `${path}.${index}`,
+        message: `PI「${pattern}」長度為 ${pattern.length}，應為 ${variableCount}。`
+      });
+      return;
+    }
+
+    const covered = expandPattern(pattern);
+    const offSet = covered.filter((minterm) => !allowed.has(minterm));
+    if (offSet.length > 0) {
+      issues.push({
+        code: 'prime-off-set',
+        path: `${path}.${index}`,
+        message: `PI「${pattern}」會覆蓋 off-set：${offSet.map((value) => `m${value}`).join('、')}。`
+      });
+    }
+  });
+
+  if (
+    uniquePatterns.every((pattern) => /^[01-]+$/.test(pattern) && pattern.length === variableCount)
+  ) {
+    onSet.forEach((minterm) => {
+      const isCovered = uniquePatterns.some((pattern) => expandPattern(pattern).includes(minterm));
+      if (!isCovered) {
+        issues.push({
+          code: 'prime-uncovered-minterm',
+          path,
+          message: `沒有任何 PI 覆蓋 m${minterm}。`
+        });
+      }
+    });
+  }
+
+  return uniquePatterns.sort();
+}
+
+export function validateProblem(raw: RawProblemInput): ValidationResult<ProblemSpec> {
+  const issues: ValidationIssue[] = [];
+  const variables = parseVariables(raw.variables, issues);
+  const variableCount = variables.length;
+  const maxValue = variableCount > 0 ? 2 ** variableCount - 1 : 0;
+
+  if (raw.functions.length === 0) {
+    issues.push({
+      code: 'functions-empty',
+      path: 'functions',
+      message: '請至少建立一個輸出函數。'
+    });
+  }
+
+  if (raw.functions.length > MAX_FUNCTIONS) {
+    issues.push({
+      code: 'functions-too-many',
+      path: 'functions',
+      message: `Exact mode 最多支援 ${MAX_FUNCTIONS} 個輸出函數。`
+    });
+  }
+
+  const names = new Set<string>();
+  const functions: LogicFunction[] = raw.functions.map((rawFunction, functionIndex) => {
+    const name = rawFunction.name.trim();
+    const basePath = `functions.${functionIndex}`;
+
+    if (!namePattern.test(name)) {
+      issues.push({
+        code: 'function-name-invalid',
+        path: `${basePath}.name`,
+        message: `函數名稱「${name}」格式無效。`
+      });
+    }
+
+    if (names.has(name)) {
+      issues.push({
+        code: 'function-name-duplicate',
+        path: `${basePath}.name`,
+        message: `函數名稱「${name}」重複。`
+      });
+    }
+    names.add(name);
+
+    const minterms = parseIntegerList(
+      rawFunction.minterms,
+      `${basePath}.minterms`,
+      'minterm-out-of-range',
+      maxValue,
+      issues
+    );
+    const dontCares = parseIntegerList(
+      rawFunction.dontCares,
+      `${basePath}.dontCares`,
+      'dont-care-out-of-range',
+      maxValue,
+      issues
+    );
+    const overlap = minterms.filter((minterm) => dontCares.includes(minterm));
+    if (overlap.length > 0) {
+      issues.push({
+        code: 'set-overlap',
+        path: basePath,
+        message: `Minterms 與 don't-cares 重疊：${overlap.map((value) => `m${value}`).join('、')}。`
+      });
+    }
+
+    const functionSpec: LogicFunction = { name, minterms, dontCares };
+    if (raw.mode === 'primes') {
+      functionSpec.providedPrimeImplicants = parsePrimeImplicants(
+        rawFunction.primeImplicants ?? '',
+        `${basePath}.primeImplicants`,
+        variableCount,
+        new Set(minterms),
+        new Set(dontCares),
+        issues
+      );
+    }
+
+    return functionSpec;
+  });
+
+  if (issues.length > 0) {
+    return { ok: false, issues };
+  }
+
+  return {
+    ok: true,
+    value: {
+      variables,
+      mode: raw.mode,
+      functions
+    }
+  };
+}
diff --git a/src/main.ts b/src/main.ts
new file mode 100644
index 0000000..345650d
--- /dev/null
+++ b/src/main.ts
@@ -0,0 +1,464 @@
+import './styles.css';
+
+import { patternToExpression, validateProblem } from './core';
+import type {
+  InputMode,
+  RawFunctionInput,
+  RawProblemInput,
+  SolverResult,
+  ValidationIssue
+} from './core';
+
+interface FunctionFormState extends RawFunctionInput {
+  id: number;
+}
+
+interface WorkerResponse {
+  id: number;
+  ok: boolean;
+  result?: SolverResult;
+  error?: string;
+}
+
+const variablesInput = getElement<HTMLInputElement>('variables');
+const functionList = getElement<HTMLDivElement>('function-list');
+const addFunctionButton = getElement<HTMLButtonElement>('add-function');
+const solveButton = getElement<HTMLButtonElement>('solve-button');
+const cancelButton = getElement<HTMLButtonElement>('cancel-button');
+const clearButton = getElement<HTMLButtonElement>('clear-button');
+const copyButton = getElement<HTMLButtonElement>('copy-button');
+const validationSummary = getElement<HTMLDivElement>('validation-summary');
+const resultRegion = getElement<HTMLDivElement>('result-region');
+const modeInputs = [...document.querySelectorAll<HTMLInputElement>('input[name="mode"]')];
+const exampleButtons = [...document.querySelectorAll<HTMLButtonElement>('[data-example]')];
+
+let functionSequence = 1;
+let functions: FunctionFormState[] = [emptyFunction('F1')];
+let currentMode: InputMode = 'minterms';
+let requestSequence = 0;
+let latestResult: SolverResult | null = null;
+let worker = createSolverWorker();
+
+function getElement<T extends HTMLElement>(id: string): T {
+  const element = document.getElementById(id);
+  if (element === null) {
+    throw new Error(`Missing #${id}`);
+  }
+  return element as T;
+}
+
+function emptyFunction(name: string): FunctionFormState {
+  return {
+    id: functionSequence++,
+    name,
+    minterms: '',
+    dontCares: '',
+    primeImplicants: ''
+  };
+}
+
+function syncStateFromDom(): void {
+  functions = functions.map((functionState) => {
+    const card = functionList.querySelector<HTMLElement>(
+      `[data-function-id="${functionState.id}"]`
+    );
+    if (card === null) {
+      return functionState;
+    }
+
+    return {
+      ...functionState,
+      name:
+        card.querySelector<HTMLInputElement>('[data-field="name"]')?.value ?? functionState.name,
+      minterms:
+        card.querySelector<HTMLInputElement>('[data-field="minterms"]')?.value ??
+        functionState.minterms,
+      dontCares:
+        card.querySelector<HTMLInputElement>('[data-field="dontCares"]')?.value ??
+        functionState.dontCares,
+      primeImplicants:
+        card.querySelector<HTMLTextAreaElement>('[data-field="primeImplicants"]')?.value ??
+        functionState.primeImplicants
+    };
+  });
+}
+
+function createField(
+  labelText: string,
+  fieldName: keyof RawFunctionInput,
+  value: string,
+  hint: string,
+  multiline = false
+): HTMLDivElement {
+  const wrapper = document.createElement('div');
+  wrapper.className = `field${fieldName === 'primeImplicants' ? ' prime-field' : ''}`;
+  const label = document.createElement('label');
+  const fieldId = `function-${fieldName}-${crypto.randomUUID()}`;
+  label.htmlFor = fieldId;
+  label.textContent = labelText;
+
+  const control = multiline ? document.createElement('textarea') : document.createElement('input');
+  control.id = fieldId;
+  control.dataset.field = fieldName;
+  control.value = value;
+  control.autocomplete = 'off';
+  control.spellcheck = false;
+  if (control instanceof HTMLInputElement) {
+    control.type = 'text';
+  }
+
+  const hintElement = document.createElement('p');
+  hintElement.className = 'field-hint';
+  hintElement.textContent = hint;
+  wrapper.append(label, control, hintElement);
+  return wrapper;
+}
+
+function renderFunctions(): void {
+  functionList.replaceChildren();
+
+  functions.forEach((functionState, index) => {
+    const card = document.createElement('article');
+    card.className = 'function-card';
+    card.dataset.functionId = String(functionState.id);
+    card.dataset.testid = `function-card-${index + 1}`;
+
+    const header = document.createElement('div');
+    header.className = 'function-header';
+    const title = document.createElement('strong');
+    title.textContent = `OUTPUT ${String(index + 1).padStart(2, '0')}`;
+    const removeButton = document.createElement('button');
+    removeButton.className = 'icon-button';
+    removeButton.type = 'button';
+    removeButton.textContent = '移除';
+    removeButton.disabled = functions.length === 1;
+    removeButton.addEventListener('click', () => {
+      syncStateFromDom();
+      functions = functions.filter((item) => item.id !== functionState.id);
+      renderFunctions();
+    });
+    header.append(title, removeButton);
+
+    const fields = document.createElement('div');
+    fields.className = 'function-fields';
+    fields.append(
+      createField('函數名稱', 'name', functionState.name, '例如 F1'),
+      createField('Minterms', 'minterms', functionState.minterms, '例如 1, 3, 5, 7'),
+      createField("Don't-cares", 'dontCares', functionState.dontCares, '可留空')
+    );
+
+    if (currentMode === 'primes') {
+      fields.append(
+        createField(
+          'Prime Implicants',
+          'primeImplicants',
+          functionState.primeImplicants ?? '',
+          '以逗號或換行分隔；例如 --1, 0-1',
+          true
+        )
+      );
+    }
+
+    card.append(header, fields);
+    functionList.append(card);
+  });
+}
+
+function collectRawProblem(): RawProblemInput {
+  syncStateFromDom();
+  return {
+    variables: variablesInput.value,
+    mode: currentMode,
+    functions: functions.map(({ name, minterms, dontCares, primeImplicants }) => ({
+      name,
+      minterms,
+      dontCares,
+      primeImplicants
+    }))
+  };
+}
+
+function renderValidation(issues: readonly ValidationIssue[]): void {
+  validationSummary.replaceChildren();
+  const title = document.createElement('strong');
+  title.textContent = `請修正 ${issues.length} 個輸入問題`;
+  const list = document.createElement('ul');
+  issues.forEach((issue) => {
+    const item = document.createElement('li');
+    item.textContent = issue.message;
+    list.append(item);
+  });
+  validationSummary.append(title, list);
+  validationSummary.hidden = false;
+}
+
+function clearValidation(): void {
+  validationSummary.hidden = true;
+  validationSummary.replaceChildren();
+}
+
+function setBusy(busy: boolean): void {
+  solveButton.disabled = busy;
+  cancelButton.hidden = !busy;
+  solveButton.querySelector('span')?.replaceChildren(busy ? '求解中…' : '執行 Exact Minimization');
+}
+
+function createSolverWorker(): Worker {
+  const nextWorker = new Worker(new URL('./worker/minimizer.worker.ts', import.meta.url), {
+    type: 'module'
+  });
+  nextWorker.addEventListener('message', handleWorkerMessage);
+  return nextWorker;
+}
+
+function createBadge(text: string): HTMLSpanElement {
+  const badge = document.createElement('span');
+  badge.className = 'badge';
+  badge.textContent = text;
+  return badge;
+}
+
+function renderResult(result: SolverResult): void {
+  latestResult = result;
+  copyButton.disabled = false;
+  resultRegion.replaceChildren();
+
+  const status = document.createElement('div');
+  status.className = 'result-status';
+  status.append(
+    createBadge('EXACT PRIME COVER'),
+    createBadge(`${result.targetCount} targets`),
+    createBadge(`${result.candidateEdgeCount} candidate edges`)
+  );
+
+  const solutions = document.createElement('div');
+  solutions.className = 'solution-list';
+  result.functions.forEach((solution) => {
+    const card = document.createElement('article');
+    card.className = 'solution-card';
+    const title = document.createElement('h3');
+    title.textContent = solution.name;
+    const expression = document.createElement('div');
+    expression.className = 'expression';
+    expression.textContent = `${solution.name} = ${solution.expression}`;
+    const patterns = document.createElement('div');
+    patterns.className = 'pattern-row';
+    solution.patterns.forEach((pattern) => {
+      const chip = document.createElement('span');
+      chip.className = 'pattern';
+      chip.textContent = pattern;
+      patterns.append(chip);
+    });
+    if (solution.patterns.length === 0) {
+      const chip = document.createElement('span');
+      chip.className = 'pattern';
+      chip.textContent = 'constant 0';
+      patterns.append(chip);
+    }
+    card.append(title, expression, patterns);
+    solutions.append(card);
+  });
+
+  const metrics = document.createElement('div');
+  metrics.className = 'metrics';
+  [
+    [String(result.totalSharedCost), 'shared cost'],
+    [String(result.sharedPatterns.length), 'shared terms'],
+    [`${result.elapsedMs.toFixed(1)} ms`, 'solver time']
+  ].forEach(([value, label]) => {
+    const metric = document.createElement('div');
+    metric.className = 'metric';
+    const strong = document.createElement('strong');
+    strong.textContent = value ?? '';
+    const span = document.createElement('span');
+    span.textContent = label ?? '';
+    metric.append(strong, span);
+    metrics.append(metric);
+  });
+
+  const details = document.createElement('details');
+  details.className = 'details';
+  const summary = document.createElement('summary');
+  summary.textContent = 'Prime Implicants 與成本模型';
+  const model = document.createElement('p');
+  model.className = 'field-hint';
+  model.textContent = result.costModel;
+  details.append(summary, model);
+
+  Object.entries(result.primeImplicants).forEach(([functionName, primes]) => {
+    const heading = document.createElement('h3');
+    heading.textContent = functionName;
+    const table = document.createElement('table');
+    table.className = 'prime-table';
+    const header = document.createElement('thead');
+    const headerRow = document.createElement('tr');
+    ['Pattern', 'Expression', 'Covers', 'Cost'].forEach((label) => {
+      const cell = document.createElement('th');
+      cell.textContent = label;
+      headerRow.append(cell);
+    });
+    header.append(headerRow);
+    const body = document.createElement('tbody');
+    primes.forEach((prime) => {
+      const row = document.createElement('tr');
+      [
+        prime.pattern,
+        patternToExpression(prime.pattern, result.variables),
+        prime.coveredMinterms.map((minterm) => `m${minterm}`).join(', '),
+        String(prime.cost)
+      ].forEach((value) => {
+        const cell = document.createElement('td');
+        cell.textContent = value;
+        row.append(cell);
+      });
+      body.append(row);
+    });
+    table.append(header, body);
+    details.append(heading, table);
+  });
+
+  resultRegion.append(status, solutions, metrics, details);
+}
+
+function renderWorkerError(message: string): void {
+  latestResult = null;
+  copyButton.disabled = true;
+  const error = document.createElement('div');
+  error.className = 'result-error';
+  const title = document.createElement('strong');
+  title.textContent = '無法完成 Exact 求解';
+  const paragraph = document.createElement('p');
+  paragraph.textContent = message;
+  error.append(title, paragraph);
+  resultRegion.replaceChildren(error);
+}
+
+function loadExample(name: string): void {
+  currentMode = 'minterms';
+  modeInputs.forEach((input) => {
+    input.checked = input.value === currentMode;
+  });
+  variablesInput.value = 'A,B,C';
+
+  if (name === 'shared') {
+    functions = [
+      { ...emptyFunction('F1'), minterms: '3,7' },
+      { ...emptyFunction('F2'), minterms: '3,7' }
+    ];
+  } else if (name === 'dont-care') {
+    functions = [{ ...emptyFunction('F1'), minterms: '1,3', dontCares: '5,7' }];
+  } else {
+    functions = [{ ...emptyFunction('F1'), minterms: '1,3,5,7' }];
+  }
+
+  clearValidation();
+  renderFunctions();
+}
+
+modeInputs.forEach((input) => {
+  input.addEventListener('change', () => {
+    if (!input.checked) {
+      return;
+    }
+    syncStateFromDom();
+    currentMode = input.value as InputMode;
+    clearValidation();
+    renderFunctions();
+  });
+});
+
+exampleButtons.forEach((button) => {
+  button.addEventListener('click', () => loadExample(button.dataset.example ?? 'single'));
+});
+
+addFunctionButton.addEventListener('click', () => {
+  syncStateFromDom();
+  if (functions.length >= 4) {
+    renderValidation([
+      {
+        code: 'functions-too-many',
+        path: 'functions',
+        message: 'Exact mode 最多支援 4 個輸出函數。'
+      }
+    ]);
+    return;
+  }
+  functions.push(emptyFunction(`F${functions.length + 1}`));
+  renderFunctions();
+});
+
+clearButton.addEventListener('click', () => {
+  variablesInput.value = 'A,B,C';
+  currentMode = 'minterms';
+  modeInputs.forEach((input) => {
+    input.checked = input.value === currentMode;
+  });
+  functions = [emptyFunction('F1')];
+  latestResult = null;
+  copyButton.disabled = true;
+  clearValidation();
+  renderFunctions();
+  resultRegion.innerHTML =
+    '<div class="empty-state"><div class="logic-mark" aria-hidden="true">Σ</div><h3>等待函數定義</h3><p>載入範例，或輸入 minterms 後執行求解。</p></div>';
+});
+
+solveButton.addEventListener('click', () => {
+  const validation = validateProblem(collectRawProblem());
+  if (!validation.ok) {
+    renderValidation(validation.issues);
+    return;
+  }
+
+  clearValidation();
+  setBusy(true);
+  requestSequence += 1;
+  worker.postMessage({ id: requestSequence, problem: validation.value });
+});
+
+function handleWorkerMessage(event: MessageEvent<WorkerResponse>): void {
+  if (event.data.id !== requestSequence) {
+    return;
+  }
+  setBusy(false);
+  if (event.data.ok && event.data.result !== undefined) {
+    renderResult(event.data.result);
+  } else {
+    renderWorkerError(event.data.error ?? '求解時發生未知錯誤。');
+  }
+}
+
+cancelButton.addEventListener('click', () => {
+  worker.terminate();
+  worker = createSolverWorker();
+  requestSequence += 1;
+  setBusy(false);
+  renderWorkerError('求解已由使用者取消。');
+});
+
+copyButton.addEventListener('click', () => {
+  void copyLatestResult();
+});
+
+async function copyLatestResult(): Promise<void> {
+  if (latestResult === null) {
+    return;
+  }
+  const text = latestResult.functions
+    .map((solution) => `${solution.name} = ${solution.expression}`)
+    .join('\n');
+  await navigator.clipboard.writeText(
+    `${text}\nShared cost: ${latestResult.totalSharedCost}\nGuarantee: Exact prime cover`
+  );
+  copyButton.textContent = '已複製';
+  window.setTimeout(() => {
+    copyButton.textContent = '複製';
+  }, 1200);
+}
+
+renderFunctions();
+
+if ('serviceWorker' in navigator) {
+  window.addEventListener('load', () => {
+    void navigator.serviceWorker.register(`${import.meta.env.BASE_URL}sw.js`);
+  });
+}
diff --git a/src/styles.css b/src/styles.css
new file mode 100644
index 0000000..75ab6cd
--- /dev/null
+++ b/src/styles.css
@@ -0,0 +1,660 @@
+:root {
+  color-scheme: light;
+  font-family:
+    Inter,
+    ui-sans-serif,
+    system-ui,
+    -apple-system,
+    BlinkMacSystemFont,
+    'Segoe UI',
+    'Noto Sans TC',
+    sans-serif;
+  color: #17223b;
+  background: #f3f0e9;
+  font-synthesis: none;
+  text-rendering: optimizeLegibility;
+  --ink: #17223b;
+  --muted: #657089;
+  --paper: #fffdf8;
+  --line: #d7d8d1;
+  --accent: #f05a3c;
+  --accent-dark: #ca3f25;
+  --teal: #087f78;
+  --soft-teal: #e3f2ee;
+  --danger: #a82525;
+  --shadow: 0 18px 55px rgb(24 34 59 / 10%);
+}
+
+* {
+  box-sizing: border-box;
+}
+
+body {
+  margin: 0;
+  min-width: 320px;
+  min-height: 100vh;
+  background:
+    linear-gradient(90deg, rgb(23 34 59 / 3%) 1px, transparent 1px),
+    linear-gradient(rgb(23 34 59 / 3%) 1px, transparent 1px), #f3f0e9;
+  background-size: 32px 32px;
+}
+
+button,
+input,
+textarea {
+  font: inherit;
+}
+
+button {
+  cursor: pointer;
+}
+
+button:disabled {
+  cursor: not-allowed;
+  opacity: 0.55;
+}
+
+a {
+  color: var(--teal);
+}
+
+.skip-link {
+  position: fixed;
+  top: 0.75rem;
+  left: 0.75rem;
+  z-index: 20;
+  padding: 0.75rem 1rem;
+  color: white;
+  background: var(--ink);
+  transform: translateY(-160%);
+}
+
+.skip-link:focus {
+  transform: translateY(0);
+}
+
+.site-header {
+  display: flex;
+  align-items: flex-end;
+  justify-content: space-between;
+  gap: 2rem;
+  max-width: 1440px;
+  margin: 0 auto;
+  padding: 3.5rem clamp(1rem, 4vw, 4rem) 2rem;
+}
+
+.eyebrow,
+.section-index {
+  margin: 0 0 0.55rem;
+  color: var(--accent-dark);
+  font-family: ui-monospace, SFMono-Regular, Menlo, Consolas, monospace;
+  font-size: 0.76rem;
+  font-weight: 800;
+  letter-spacing: 0.14em;
+}
+
+h1,
+h2,
+h3,
+p {
+  margin-top: 0;
+}
+
+h1 {
+  max-width: 850px;
+  margin-bottom: 0.75rem;
+  font-family: Georgia, 'Noto Serif TC', serif;
+  font-size: clamp(2.5rem, 6vw, 5.8rem);
+  font-weight: 700;
+  letter-spacing: -0.055em;
+  line-height: 0.95;
+}
+
+.lede {
+  max-width: 760px;
+  margin-bottom: 0;
+  color: var(--muted);
+  font-size: clamp(1rem, 2vw, 1.22rem);
+  line-height: 1.65;
+}
+
+.guarantee-card {
+  display: flex;
+  align-items: center;
+  flex: 0 0 auto;
+  gap: 0.8rem;
+  min-width: 230px;
+  padding: 1rem 1.1rem;
+  border: 1px solid #b8d3cc;
+  background: var(--soft-teal);
+}
+
+.guarantee-card div {
+  display: grid;
+  gap: 0.15rem;
+}
+
+.guarantee-card span:last-child {
+  color: #3e6c67;
+  font-size: 0.82rem;
+}
+
+.status-dot {
+  width: 0.68rem;
+  height: 0.68rem;
+  border-radius: 50%;
+  background: var(--teal);
+  box-shadow: 0 0 0 5px rgb(8 127 120 / 12%);
+}
+
+.workspace {
+  display: grid;
+  grid-template-columns: minmax(0, 0.95fr) minmax(0, 1.05fr);
+  max-width: 1440px;
+  margin: 0 auto;
+  padding: 0 clamp(1rem, 4vw, 4rem);
+  border-top: 1px solid var(--line);
+  border-bottom: 1px solid var(--line);
+}
+
+.panel {
+  min-width: 0;
+  padding: clamp(1.5rem, 3vw, 3rem);
+  background: rgb(255 253 248 / 90%);
+}
+
+.input-panel {
+  border-right: 1px solid var(--line);
+}
+
+.section-heading {
+  display: flex;
+  align-items: flex-start;
+  justify-content: space-between;
+  gap: 1rem;
+  margin-bottom: 2rem;
+}
+
+.section-heading h2 {
+  margin: 0;
+  font-size: clamp(1.65rem, 3vw, 2.4rem);
+  letter-spacing: -0.035em;
+}
+
+.field {
+  display: grid;
+  gap: 0.5rem;
+  margin-bottom: 1.35rem;
+}
+
+.field label,
+legend {
+  color: var(--ink);
+  font-size: 0.86rem;
+  font-weight: 750;
+}
+
+.field input,
+.field textarea {
+  width: 100%;
+  border: 1px solid #bfc2bb;
+  border-radius: 0;
+  outline: none;
+  background: white;
+  color: var(--ink);
+  transition:
+    border-color 150ms ease,
+    box-shadow 150ms ease;
+}
+
+.field input {
+  height: 3rem;
+  padding: 0 0.85rem;
+}
+
+.field textarea {
+  min-height: 4.8rem;
+  padding: 0.8rem;
+  resize: vertical;
+}
+
+.field input:focus,
+.field textarea:focus {
+  border-color: var(--teal);
+  box-shadow: 0 0 0 3px rgb(8 127 120 / 12%);
+}
+
+.field-hint {
+  margin: 0;
+  color: var(--muted);
+  font-size: 0.78rem;
+  line-height: 1.45;
+}
+
+.mode-switch {
+  display: grid;
+  grid-template-columns: repeat(2, 1fr);
+  gap: 0.55rem;
+  margin: 0 0 1rem;
+  padding: 0;
+  border: 0;
+}
+
+.mode-switch legend {
+  margin-bottom: 0.55rem;
+}
+
+.mode-switch label {
+  position: relative;
+}
+
+.mode-switch input {
+  position: absolute;
+  opacity: 0;
+}
+
+.mode-switch span {
+  display: block;
+  padding: 0.8rem 1rem;
+  border: 1px solid #bfc2bb;
+  background: white;
+  color: var(--muted);
+  text-align: center;
+}
+
+.mode-switch input:checked + span {
+  border-color: var(--ink);
+  background: var(--ink);
+  color: white;
+}
+
+.mode-switch input:focus-visible + span {
+  outline: 3px solid rgb(8 127 120 / 30%);
+  outline-offset: 2px;
+}
+
+.examples {
+  display: flex;
+  flex-wrap: wrap;
+  align-items: center;
+  gap: 0.5rem;
+  margin-bottom: 1.4rem;
+  color: var(--muted);
+  font-size: 0.78rem;
+}
+
+.example-button {
+  padding: 0.35rem 0.62rem;
+  border: 1px solid #c9cbc4;
+  background: transparent;
+  color: var(--ink);
+}
+
+.example-button:hover {
+  border-color: var(--teal);
+  color: var(--teal);
+}
+
+.function-list {
+  display: grid;
+  gap: 0.85rem;
+}
+
+.function-card {
+  border: 1px solid var(--line);
+  background: #fff;
+}
+
+.function-header {
+  display: flex;
+  align-items: center;
+  justify-content: space-between;
+  padding: 0.8rem 0.9rem;
+  border-bottom: 1px solid var(--line);
+  background: #f7f6f1;
+}
+
+.function-header strong {
+  font-family: ui-monospace, SFMono-Regular, Menlo, Consolas, monospace;
+}
+
+.function-fields {
+  display: grid;
+  grid-template-columns: 0.72fr 1fr 1fr;
+  gap: 0.75rem;
+  padding: 0.9rem;
+}
+
+.function-fields .field {
+  margin: 0;
+}
+
+.prime-field {
+  grid-column: 1 / -1;
+}
+
+.icon-button {
+  border: 0;
+  background: transparent;
+  color: var(--danger);
+  font-size: 0.8rem;
+  font-weight: 750;
+}
+
+.input-actions {
+  display: flex;
+  justify-content: space-between;
+  gap: 0.8rem;
+  margin-top: 1rem;
+}
+
+.button {
+  display: inline-flex;
+  align-items: center;
+  justify-content: center;
+  gap: 1rem;
+  min-height: 2.65rem;
+  padding: 0.65rem 1rem;
+  border: 1px solid transparent;
+  font-weight: 750;
+}
+
+.button-primary {
+  flex: 1;
+  background: var(--accent);
+  color: white;
+}
+
+.button-primary:hover {
+  background: var(--accent-dark);
+}
+
+.button-secondary {
+  border-color: var(--ink);
+  background: white;
+  color: var(--ink);
+}
+
+.button-ghost {
+  min-height: auto;
+  padding: 0.4rem 0;
+  border: 0;
+  background: transparent;
+  color: var(--muted);
+}
+
+.validation-summary {
+  margin-top: 1rem;
+  padding: 0.9rem 1rem;
+  border-left: 4px solid var(--danger);
+  background: #fff0ed;
+  color: #771d1d;
+}
+
+.validation-summary strong {
+  display: block;
+  margin-bottom: 0.4rem;
+}
+
+.validation-summary ul {
+  margin: 0;
+  padding-left: 1.2rem;
+}
+
+.result-region {
+  min-height: 540px;
+}
+
+.empty-state {
+  display: grid;
+  min-height: 500px;
+  place-content: center;
+  text-align: center;
+}
+
+.logic-mark {
+  width: 5rem;
+  height: 5rem;
+  margin: 0 auto 1.2rem;
+  border: 1px solid var(--line);
+  color: var(--accent);
+  font-family: Georgia, serif;
+  font-size: 3rem;
+  line-height: 4.8rem;
+}
+
+.empty-state h3 {
+  margin-bottom: 0.4rem;
+  font-size: 1.35rem;
+}
+
+.empty-state p {
+  color: var(--muted);
+}
+
+.result-status {
+  display: flex;
+  flex-wrap: wrap;
+  gap: 0.5rem;
+  margin-bottom: 1.4rem;
+}
+
+.badge {
+  display: inline-flex;
+  padding: 0.35rem 0.58rem;
+  border: 1px solid #b8d3cc;
+  background: var(--soft-teal);
+  color: #17645f;
+  font-size: 0.75rem;
+  font-weight: 750;
+}
+
+.solution-list {
+  display: grid;
+  gap: 0.75rem;
+}
+
+.solution-card {
+  padding: 1rem;
+  border: 1px solid var(--line);
+  background: white;
+}
+
+.solution-card h3 {
+  margin-bottom: 0.45rem;
+  color: var(--muted);
+  font-family: ui-monospace, SFMono-Regular, Menlo, Consolas, monospace;
+  font-size: 0.78rem;
+  letter-spacing: 0.08em;
+}
+
+.expression {
+  overflow-wrap: anywhere;
+  margin-bottom: 0.8rem;
+  font-family: Georgia, 'Noto Serif TC', serif;
+  font-size: clamp(1.5rem, 4vw, 2.5rem);
+  line-height: 1.25;
+}
+
+.pattern-row {
+  display: flex;
+  flex-wrap: wrap;
+  gap: 0.4rem;
+}
+
+.pattern {
+  padding: 0.28rem 0.45rem;
+  background: #f1f0eb;
+  font-family: ui-monospace, SFMono-Regular, Menlo, Consolas, monospace;
+  font-size: 0.78rem;
+}
+
+.metrics {
+  display: grid;
+  grid-template-columns: repeat(3, 1fr);
+  margin: 1.2rem 0;
+  border: 1px solid var(--line);
+}
+
+.metric {
+  padding: 0.9rem;
+  border-right: 1px solid var(--line);
+}
+
+.metric:last-child {
+  border-right: 0;
+}
+
+.metric strong,
+.metric span {
+  display: block;
+}
+
+.metric strong {
+  font-size: 1.4rem;
+}
+
+.metric span {
+  margin-top: 0.2rem;
+  color: var(--muted);
+  font-size: 0.72rem;
+}
+
+.details {
+  margin-top: 1rem;
+  border-top: 1px solid var(--line);
+}
+
+.details summary {
+  padding: 0.9rem 0;
+  cursor: pointer;
+  font-weight: 750;
+}
+
+.prime-table {
+  width: 100%;
+  border-collapse: collapse;
+  font-size: 0.78rem;
+}
+
+.prime-table th,
+.prime-table td {
+  padding: 0.55rem;
+  border-bottom: 1px solid var(--line);
+  text-align: left;
+}
+
+.prime-table th {
+  color: var(--muted);
+  font-weight: 650;
+}
+
+.result-error {
+  padding: 1rem;
+  border-left: 4px solid var(--danger);
+  background: #fff0ed;
+}
+
+.evidence-strip {
+  display: grid;
+  grid-template-columns: repeat(3, 1fr);
+  max-width: 1440px;
+  margin: 0 auto;
+  padding: 0 clamp(1rem, 4vw, 4rem);
+}
+
+.evidence-strip > div {
+  display: grid;
+  gap: 0.2rem;
+  padding: 1.4rem;
+  border-right: 1px solid var(--line);
+}
+
+.evidence-strip > div:first-child {
+  border-left: 1px solid var(--line);
+}
+
+.evidence-value {
+  font-family: Georgia, serif;
+  font-size: 1.5rem;
+  font-weight: 700;
+}
+
+.evidence-label {
+  color: var(--muted);
+  font-size: 0.76rem;
+}
+
+footer {
+  max-width: 1440px;
+  margin: 0 auto;
+  padding: 2rem clamp(1rem, 4vw, 4rem) 3rem;
+  color: var(--muted);
+  font-size: 0.82rem;
+}
+
+footer p {
+  margin: 0;
+}
+
+@media (max-width: 900px) {
+  .site-header {
+    align-items: flex-start;
+    flex-direction: column;
+  }
+
+  .workspace {
+    grid-template-columns: 1fr;
+  }
+
+  .input-panel {
+    border-right: 0;
+    border-bottom: 1px solid var(--line);
+  }
+
+  .result-region,
+  .empty-state {
+    min-height: 360px;
+  }
+}
+
+@media (max-width: 620px) {
+  .site-header {
+    padding-top: 2rem;
+  }
+
+  .guarantee-card {
+    width: 100%;
+  }
+
+  .function-fields {
+    grid-template-columns: 1fr;
+  }
+
+  .prime-field {
+    grid-column: auto;
+  }
+
+  .input-actions {
+    flex-direction: column;
+  }
+
+  .button-primary {
+    min-height: 3.2rem;
+  }
+
+  .metrics,
+  .evidence-strip {
+    grid-template-columns: 1fr;
+  }
+
+  .metric,
+  .evidence-strip > div {
+    border-right: 0;
+    border-bottom: 1px solid var(--line);
+  }
+
+  .evidence-strip > div:first-child {
+    border-left: 0;
+  }
+}
diff --git a/src/vite-env.d.ts b/src/vite-env.d.ts
new file mode 100644
index 0000000..11f02fe
--- /dev/null
+++ b/src/vite-env.d.ts
@@ -0,0 +1 @@
+/// <reference types="vite/client" />
diff --git a/src/worker/minimizer.worker.ts b/src/worker/minimizer.worker.ts
new file mode 100644
index 0000000..db5be4f
--- /dev/null
+++ b/src/worker/minimizer.worker.ts
@@ -0,0 +1,29 @@
+/// <reference lib="webworker" />
+
+import { solveProblem } from '../core';
+import type { ProblemSpec, SolverResult } from '../core';
+
+interface SolveRequest {
+  id: number;
+  problem: ProblemSpec;
+}
+
+type SolveResponse =
+  { id: number; ok: true; result: SolverResult } | { id: number; ok: false; error: string };
+
+const worker = self as DedicatedWorkerGlobalScope;
+
+worker.addEventListener('message', (event: MessageEvent<SolveRequest>) => {
+  const { id, problem } = event.data;
+
+  try {
+    const result = solveProblem(problem);
+    worker.postMessage({ id, ok: true, result } satisfies SolveResponse);
+  } catch (error) {
+    worker.postMessage({
+      id,
+      ok: false,
+      error: error instanceof Error ? error.message : '求解時發生未知錯誤。'
+    } satisfies SolveResponse);
+  }
+});
diff --git a/sw.js b/sw.js
deleted file mode 100644
index 60201d7..0000000
--- a/sw.js
+++ /dev/null
@@ -1,38 +0,0 @@
-// Service Worker 用於 PWA 離線功能
-// 定義快取名稱和需要快取的檔案清單
-const CACHE_NAME = 'boolean-minimizer-v1';
-const urlsToCache = [
-  './',
-  './index.html',
-  './patrick-method-core.js',
-  './manifest.json'
-];
-
-// 監聽 Service Worker 安裝事件
-self.addEventListener('install', function(event) {
-  // 等待快取操作完成
-  event.waitUntil(
-    caches.open(CACHE_NAME)
-      .then(function(cache) {
-        // 將指定的檔案加入快取
-        return cache.addAll(urlsToCache);
-      })
-  );
-});
-
-// 監聽網路請求事件
-self.addEventListener('fetch', function(event) {
-  // 攔截所有網路請求
-  event.respondWith(
-    caches.match(event.request)
-      .then(function(response) {
-        // 如果快取中有對應的資源，直接回傳快取版本
-        if (response) {
-          return response;
-        }
-        // 否則發送網路請求取得資源
-        return fetch(event.request);
-      }
-    )
-  );
-}); 
\ No newline at end of file
diff --git a/tests/e2e/minimizer.spec.ts b/tests/e2e/minimizer.spec.ts
new file mode 100644
index 0000000..af77240
--- /dev/null
+++ b/tests/e2e/minimizer.spec.ts
@@ -0,0 +1,56 @@
+import { expect, test } from '@playwright/test';
+
+test('solves the single-output example exactly', async ({ page }) => {
+  await page.goto('/');
+  await page.getByRole('button', { name: '單輸出' }).click();
+  await page.getByRole('button', { name: '執行 Exact Minimization' }).click();
+
+  await expect(page.getByText('F1 = C')).toBeVisible();
+  await expect(page.getByText('EXACT PRIME COVER', { exact: true })).toBeVisible();
+  await expect(page.locator('.metric').filter({ hasText: 'shared cost' })).toContainText('1');
+});
+
+test('rejects a minterm outside the selected variable range', async ({ page }) => {
+  await page.goto('/');
+  const functionCard = page.getByTestId('function-card-1');
+  await functionCard.locator('[data-field="minterms"]').fill('8');
+  await page.getByRole('button', { name: '執行 Exact Minimization' }).click();
+
+  await expect(page.getByRole('alert')).toContainText('m8 超出目前變數可表示的範圍 0–7。');
+  await expect(page.getByText(/X3/)).toHaveCount(0);
+});
+
+test('shows a shared product term for two outputs', async ({ page }) => {
+  await page.goto('/');
+  await page.getByRole('button', { name: '共享項' }).click();
+  await page.getByRole('button', { name: '執行 Exact Minimization' }).click();
+
+  await expect(page.getByText('F1 = BC')).toBeVisible();
+  await expect(page.getByText('F2 = BC')).toBeVisible();
+  await expect(page.locator('.metric').filter({ hasText: 'shared terms' })).toContainText('1');
+});
+
+test('supports the advanced Prime Implicants input mode', async ({ page }) => {
+  await page.goto('/');
+  await page.getByRole('radio', { name: 'Prime Implicants' }).check();
+  const functionCard = page.getByTestId('function-card-1');
+  await functionCard.locator('[data-field="minterms"]').fill('1,3,5,7');
+  await functionCard.locator('[data-field="primeImplicants"]').fill('--1, 0-1');
+  await page.getByRole('button', { name: '執行 Exact Minimization' }).click();
+
+  await expect(page.getByText('F1 = C')).toBeVisible();
+});
+
+test('loads the application shell while offline after the first visit', async ({
+  context,
+  page
+}) => {
+  await page.goto('/');
+  await page.evaluate(async () => navigator.serviceWorker.ready);
+  await page.waitForTimeout(250);
+  await context.setOffline(true);
+  await page.reload();
+
+  await expect(page.getByRole('heading', { name: 'Boolean Logic Minimizer' })).toBeVisible();
+  await expect(page.getByRole('button', { name: '執行 Exact Minimization' })).toBeVisible();
+});
diff --git a/tests/property/exhaustive-three-variable.test.ts b/tests/property/exhaustive-three-variable.test.ts
new file mode 100644
index 0000000..b846623
--- /dev/null
+++ b/tests/property/exhaustive-three-variable.test.ts
@@ -0,0 +1,80 @@
+import { describe, expect, it } from 'vitest';
+
+import { expandPattern, productTermCost, solveProblem } from '../../src/core';
+import type { ProblemSpec } from '../../src/core';
+
+function allPatterns(length: number, prefix = ''): string[] {
+  if (prefix.length === length) {
+    return [prefix];
+  }
+  return ['0', '1', '-'].flatMap((bit) => allPatterns(length, `${prefix}${bit}`));
+}
+
+function oracleCost(onSet: readonly number[], variableCount: number): number {
+  if (onSet.length === 0) {
+    return 0;
+  }
+
+  const onSetLookup = new Set(onSet);
+  const candidates = allPatterns(variableCount)
+    .map((pattern) => ({
+      pattern,
+      covered: expandPattern(pattern)
+    }))
+    .filter(
+      (candidate) =>
+        candidate.covered.some((minterm) => onSetLookup.has(minterm)) &&
+        candidate.covered.every((minterm) => onSetLookup.has(minterm))
+    );
+  const targetIndex = new Map(onSet.map((minterm, index) => [minterm, index]));
+  const fullMask = (1 << onSet.length) - 1;
+  const best = new Array<number>(1 << onSet.length).fill(Number.POSITIVE_INFINITY);
+  best[0] = 0;
+
+  for (let mask = 0; mask <= fullMask; mask += 1) {
+    const current = best[mask];
+    if (current === undefined || !Number.isFinite(current)) {
+      continue;
+    }
+
+    candidates.forEach((candidate) => {
+      const candidateMask = candidate.covered.reduce((result, minterm) => {
+        const index = targetIndex.get(minterm);
+        return index === undefined ? result : result | (1 << index);
+      }, 0);
+      const nextMask = mask | candidateMask;
+      best[nextMask] = Math.min(
+        best[nextMask] ?? Number.POSITIVE_INFINITY,
+        current + productTermCost(candidate.pattern)
+      );
+    });
+  }
+
+  return best[fullMask] ?? Number.POSITIVE_INFINITY;
+}
+
+describe('three-variable exhaustive oracle', () => {
+  it('matches all 256 truth tables', () => {
+    for (let functionMask = 0; functionMask < 256; functionMask += 1) {
+      const minterms = Array.from({ length: 8 }, (_, minterm) => minterm).filter(
+        (minterm) => (functionMask & (1 << minterm)) !== 0
+      );
+      const problem: ProblemSpec = {
+        variables: ['A', 'B', 'C'],
+        mode: 'minterms',
+        functions: [{ name: 'F1', minterms, dontCares: [] }]
+      };
+      const result = solveProblem(problem);
+      const selected = result.functions[0]?.patterns ?? [];
+      const covered = new Set(selected.flatMap((pattern) => expandPattern(pattern)));
+
+      expect(
+        [...covered].sort((left, right) => left - right),
+        `truth-table mask ${functionMask}`
+      ).toEqual(minterms);
+      expect(result.totalSharedCost, `optimal cost for mask ${functionMask}`).toBe(
+        oracleCost(minterms, 3)
+      );
+    }
+  });
+});
diff --git a/tests/property/four-variable-equivalence.test.ts b/tests/property/four-variable-equivalence.test.ts
new file mode 100644
index 0000000..e855538
--- /dev/null
+++ b/tests/property/four-variable-equivalence.test.ts
@@ -0,0 +1,33 @@
+import fc from 'fast-check';
+import { describe, expect, it } from 'vitest';
+
+import { expandPattern, solveProblem } from '../../src/core';
+import type { ProblemSpec } from '../../src/core';
+
+describe('four-variable property checks', () => {
+  it('never changes the requested truth table', () => {
+    fc.assert(
+      fc.property(
+        fc.uniqueArray(fc.integer({ min: 0, max: 15 }), {
+          minLength: 0,
+          maxLength: 16
+        }),
+        (rawMinterms) => {
+          const minterms = [...rawMinterms].sort((left, right) => left - right);
+          const problem: ProblemSpec = {
+            variables: ['A', 'B', 'C', 'D'],
+            mode: 'minterms',
+            functions: [{ name: 'F1', minterms, dontCares: [] }]
+          };
+          const result = solveProblem(problem);
+          const covered = new Set(
+            result.functions[0]?.patterns.flatMap((pattern) => expandPattern(pattern)) ?? []
+          );
+
+          expect([...covered].sort((left, right) => left - right)).toEqual(minterms);
+        }
+      ),
+      { numRuns: 200, seed: 20260729 }
+    );
+  });
+});
diff --git a/tests/regression/legacy-fixtures.test.ts b/tests/regression/legacy-fixtures.test.ts
new file mode 100644
index 0000000..c85eeee
--- /dev/null
+++ b/tests/regression/legacy-fixtures.test.ts
@@ -0,0 +1,54 @@
+import { describe, expect, it } from 'vitest';
+
+import { expandPattern, solveProblem, validateProblem } from '../../src/core';
+import type { RawProblemInput } from '../../src/core';
+
+function solve(raw: RawProblemInput) {
+  const validation = validateProblem(raw);
+  if (!validation.ok) {
+    throw new Error(validation.issues.map((issue) => issue.message).join('\n'));
+  }
+  return solveProblem(validation.value);
+}
+
+describe('legacy documentation fixtures', () => {
+  it('covers the README multi-output example exactly', () => {
+    const result = solve({
+      variables: 'A,B,C',
+      mode: 'minterms',
+      functions: [
+        { name: 'F1', minterms: '2,3,6,7', dontCares: '1' },
+        { name: 'F2', minterms: '1,4,5', dontCares: '0' }
+      ]
+    });
+
+    const expected = new Map([
+      ['F1', [2, 3, 6, 7]],
+      ['F2', [1, 4, 5]]
+    ]);
+
+    result.functions.forEach((solution) => {
+      const covered = new Set(solution.patterns.flatMap((pattern) => expandPattern(pattern)));
+      const allowed = new Set([
+        ...(expected.get(solution.name) ?? []),
+        ...(solution.name === 'F1' ? [1] : [0])
+      ]);
+
+      expect(expected.get(solution.name)?.every((minterm) => covered.has(minterm))).toBe(true);
+      expect([...covered].every((minterm) => allowed.has(minterm))).toBe(true);
+    });
+  });
+
+  it('keeps the m8 boundary bug fixed', () => {
+    const validation = validateProblem({
+      variables: 'A,B,C',
+      mode: 'minterms',
+      functions: [{ name: 'F1', minterms: '8', dontCares: '' }]
+    });
+
+    expect(validation.ok).toBe(false);
+    if (!validation.ok) {
+      expect(validation.issues.map((issue) => issue.code)).toContain('minterm-out-of-range');
+    }
+  });
+});
diff --git a/tests/unit/solver.test.ts b/tests/unit/solver.test.ts
new file mode 100644
index 0000000..fbce5b8
--- /dev/null
+++ b/tests/unit/solver.test.ts
@@ -0,0 +1,103 @@
+import { describe, expect, it } from 'vitest';
+
+import {
+  expandPattern,
+  generatePrimeImplicants,
+  solveProblem,
+  validateProblem
+} from '../../src/core';
+import type { RawProblemInput } from '../../src/core';
+
+function solve(raw: RawProblemInput) {
+  const validation = validateProblem(raw);
+  if (!validation.ok) {
+    throw new Error(validation.issues.map((issue) => issue.message).join('\n'));
+  }
+  return solveProblem(validation.value);
+}
+
+describe('Quine–McCluskey and Petrick solver', () => {
+  it('reduces odd three-variable minterms to C', () => {
+    const result = solve({
+      variables: 'A,B,C',
+      mode: 'minterms',
+      functions: [{ name: 'F1', minterms: '1,3,5,7', dontCares: '' }]
+    });
+
+    expect(result.functions[0]).toEqual({
+      name: 'F1',
+      expression: 'C',
+      patterns: ['--1'],
+      individualCost: 1
+    });
+    expect(result.totalSharedCost).toBe(1);
+    expect(result.guarantee).toBe('exact-prime-cover');
+  });
+
+  it('uses a dont-care to form a larger implicant', () => {
+    const primes = generatePrimeImplicants([1, 3], [5, 7], 3);
+
+    expect(primes).toContainEqual(
+      expect.objectContaining({
+        pattern: '--1',
+        coveredMinterms: [1, 3]
+      })
+    );
+  });
+
+  it('shares the base product term cost across outputs', () => {
+    const result = solve({
+      variables: 'A,B,C',
+      mode: 'minterms',
+      functions: [
+        { name: 'F1', minterms: '3,7', dontCares: '' },
+        { name: 'F2', minterms: '3,7', dontCares: '' }
+      ]
+    });
+
+    expect(result.functions.map((item) => item.expression)).toEqual(['BC', 'BC']);
+    expect(result.sharedPatterns).toEqual([{ pattern: '-11', functions: ['F1', 'F2'] }]);
+    expect(result.totalSharedCost).toBe(4);
+  });
+
+  it('supports provided prime implicants without regenerating them', () => {
+    const result = solve({
+      variables: 'A,B,C',
+      mode: 'primes',
+      functions: [
+        {
+          name: 'F1',
+          minterms: '1,3,5,7',
+          dontCares: '',
+          primeImplicants: '--1,0-1'
+        }
+      ]
+    });
+
+    expect(result.functions[0]?.patterns).toEqual(['--1']);
+  });
+
+  it('represents the constant-zero function', () => {
+    const result = solve({
+      variables: 'A,B',
+      mode: 'minterms',
+      functions: [{ name: 'F1', minterms: '', dontCares: '' }]
+    });
+
+    expect(result.functions[0]?.expression).toBe('0');
+    expect(result.totalSharedCost).toBe(0);
+  });
+
+  it('produces expressions that cover exactly the requested on-set', () => {
+    const result = solve({
+      variables: 'A,B,C',
+      mode: 'minterms',
+      functions: [{ name: 'F1', minterms: '2,3,6,7', dontCares: '' }]
+    });
+    const covered = new Set(
+      result.functions[0]?.patterns.flatMap((pattern) => expandPattern(pattern)) ?? []
+    );
+
+    expect([...covered].sort((left, right) => left - right)).toEqual([2, 3, 6, 7]);
+  });
+});
diff --git a/tests/unit/validation.test.ts b/tests/unit/validation.test.ts
new file mode 100644
index 0000000..5b21d01
--- /dev/null
+++ b/tests/unit/validation.test.ts
@@ -0,0 +1,115 @@
+import { describe, expect, it } from 'vitest';
+
+import { validateProblem } from '../../src/core';
+import type { RawProblemInput } from '../../src/core';
+
+function input(overrides: Partial<RawProblemInput> = {}): RawProblemInput {
+  return {
+    variables: 'A,B,C',
+    mode: 'minterms',
+    functions: [{ name: 'F1', minterms: '1,3,5,7', dontCares: '' }],
+    ...overrides
+  };
+}
+
+describe('validateProblem', () => {
+  it('normalizes a valid minterm problem', () => {
+    const result = validateProblem(input());
+
+    expect(result).toEqual({
+      ok: true,
+      value: {
+        variables: ['A', 'B', 'C'],
+        mode: 'minterms',
+        functions: [{ name: 'F1', minterms: [1, 3, 5, 7], dontCares: [] }]
+      }
+    });
+  });
+
+  it('rejects a minterm that cannot be represented by the variables', () => {
+    const result = validateProblem(
+      input({
+        functions: [{ name: 'F1', minterms: '8', dontCares: '' }]
+      })
+    );
+
+    expect(result.ok).toBe(false);
+    if (!result.ok) {
+      expect(result.issues).toContainEqual(
+        expect.objectContaining({
+          code: 'minterm-out-of-range',
+          path: 'functions.0.minterms.0'
+        })
+      );
+    }
+  });
+
+  it('rejects duplicates and minterm/dont-care overlap', () => {
+    const result = validateProblem(
+      input({
+        functions: [{ name: 'F1', minterms: '1,1,3', dontCares: '3' }]
+      })
+    );
+
+    expect(result.ok).toBe(false);
+    if (!result.ok) {
+      expect(result.issues.map((issue) => issue.code)).toEqual(
+        expect.arrayContaining(['integer-duplicate', 'set-overlap'])
+      );
+    }
+  });
+
+  it('validates provided prime implicants', () => {
+    const result = validateProblem(
+      input({
+        mode: 'primes',
+        functions: [
+          {
+            name: 'F1',
+            minterms: '1,3,5,7',
+            dontCares: '',
+            primeImplicants: '--1'
+          }
+        ]
+      })
+    );
+
+    expect(result.ok).toBe(true);
+  });
+
+  it('rejects a provided PI with the wrong width or off-set coverage', () => {
+    const wrongWidth = validateProblem(
+      input({
+        mode: 'primes',
+        functions: [
+          {
+            name: 'F1',
+            minterms: '1,3,5,7',
+            dontCares: '',
+            primeImplicants: '---1'
+          }
+        ]
+      })
+    );
+    const coversOffSet = validateProblem(
+      input({
+        mode: 'primes',
+        functions: [
+          {
+            name: 'F1',
+            minterms: '1',
+            dontCares: '',
+            primeImplicants: '--1'
+          }
+        ]
+      })
+    );
+
+    expect(wrongWidth.ok).toBe(false);
+    expect(coversOffSet.ok).toBe(false);
+    if (!wrongWidth.ok && !coversOffSet.ok) {
+      expect(wrongWidth.issues.some((issue) => issue.code === 'prime-width')).toBe(true);
+      expect(coversOffSet.issues.some((issue) => issue.code === 'prime-off-set')).toBe(true);
+    }
+  });
+});
diff --git a/tsconfig.app.json b/tsconfig.app.json
new file mode 100644
index 0000000..60a9eab
--- /dev/null
+++ b/tsconfig.app.json
@@ -0,0 +1,19 @@
+{
+  "compilerOptions": {
+    "target": "ES2022",
+    "useDefineForClassFields": true,
+    "module": "ESNext",
+    "lib": ["ES2022", "DOM", "DOM.Iterable", "WebWorker"],
+    "skipLibCheck": true,
+    "moduleResolution": "Bundler",
+    "allowImportingTsExtensions": false,
+    "verbatimModuleSyntax": true,
+    "moduleDetection": "force",
+    "noEmit": true,
+    "strict": true,
+    "noUncheckedIndexedAccess": true,
+    "noUnusedLocals": true,
+    "noUnusedParameters": true
+  },
+  "include": ["src", "tests"]
+}
diff --git a/tsconfig.json b/tsconfig.json
new file mode 100644
index 0000000..d32ff68
--- /dev/null
+++ b/tsconfig.json
@@ -0,0 +1,4 @@
+{
+  "files": [],
+  "references": [{ "path": "./tsconfig.app.json" }, { "path": "./tsconfig.node.json" }]
+}
diff --git a/tsconfig.node.json b/tsconfig.node.json
new file mode 100644
index 0000000..1318de4
--- /dev/null
+++ b/tsconfig.node.json
@@ -0,0 +1,13 @@
+{
+  "compilerOptions": {
+    "composite": true,
+    "skipLibCheck": true,
+    "module": "ESNext",
+    "moduleResolution": "Bundler",
+    "allowSyntheticDefaultImports": true,
+    "strict": true,
+    "types": ["node"],
+    "noEmit": true
+  },
+  "include": ["vite.config.ts", "playwright.config.ts", "eslint.config.js"]
+}
diff --git a/vite.config.ts b/vite.config.ts
new file mode 100644
index 0000000..4f00d01
--- /dev/null
+++ b/vite.config.ts
@@ -0,0 +1,13 @@
+import { defineConfig } from 'vitest/config';
+
+export default defineConfig({
+  base: '/boolean-function-minimizer/',
+  test: {
+    environment: 'node',
+    include: ['tests/{unit,property,regression}/**/*.test.ts'],
+    coverage: {
+      reporter: ['text', 'json-summary'],
+      include: ['src/core/**/*.ts']
+    }
+  }
+});
diff --git a/windows11/LargeTile.scale-100.png b/windows11/LargeTile.scale-100.png
deleted file mode 100644
index a9036b2..0000000
Binary files a/windows11/LargeTile.scale-100.png and /dev/null differ
diff --git a/windows11/LargeTile.scale-125.png b/windows11/LargeTile.scale-125.png
deleted file mode 100644
index 06b753b..0000000
Binary files a/windows11/LargeTile.scale-125.png and /dev/null differ
diff --git a/windows11/LargeTile.scale-150.png b/windows11/LargeTile.scale-150.png
deleted file mode 100644
index 08f0e75..0000000
Binary files a/windows11/LargeTile.scale-150.png and /dev/null differ
diff --git a/windows11/LargeTile.scale-200.png b/windows11/LargeTile.scale-200.png
deleted file mode 100644
index 045d807..0000000
Binary files a/windows11/LargeTile.scale-200.png and /dev/null differ
diff --git a/windows11/LargeTile.scale-400.png b/windows11/LargeTile.scale-400.png
deleted file mode 100644
index 2886f8d..0000000
Binary files a/windows11/LargeTile.scale-400.png and /dev/null differ
diff --git a/windows11/SmallTile.scale-100.png b/windows11/SmallTile.scale-100.png
deleted file mode 100644
index 7471e8e..0000000
Binary files a/windows11/SmallTile.scale-100.png and /dev/null differ
diff --git a/windows11/SmallTile.scale-125.png b/windows11/SmallTile.scale-125.png
deleted file mode 100644
index b081660..0000000
Binary files a/windows11/SmallTile.scale-125.png and /dev/null differ
diff --git a/windows11/SmallTile.scale-150.png b/windows11/SmallTile.scale-150.png
deleted file mode 100644
index 9319bfb..0000000
Binary files a/windows11/SmallTile.scale-150.png and /dev/null differ
diff --git a/windows11/SmallTile.scale-200.png b/windows11/SmallTile.scale-200.png
deleted file mode 100644
index 563db3f..0000000
Binary files a/windows11/SmallTile.scale-200.png and /dev/null differ
diff --git a/windows11/SmallTile.scale-400.png b/windows11/SmallTile.scale-400.png
deleted file mode 100644
index ff06a8a..0000000
Binary files a/windows11/SmallTile.scale-400.png and /dev/null differ
diff --git a/windows11/SplashScreen.scale-100.png b/windows11/SplashScreen.scale-100.png
deleted file mode 100644
index bf453eb..0000000
Binary files a/windows11/SplashScreen.scale-100.png and /dev/null differ
diff --git a/windows11/SplashScreen.scale-125.png b/windows11/SplashScreen.scale-125.png
deleted file mode 100644
index 43cd76f..0000000
Binary files a/windows11/SplashScreen.scale-125.png and /dev/null differ
diff --git a/windows11/SplashScreen.scale-150.png b/windows11/SplashScreen.scale-150.png
deleted file mode 100644
index e8a84c0..0000000
Binary files a/windows11/SplashScreen.scale-150.png and /dev/null differ
diff --git a/windows11/SplashScreen.scale-200.png b/windows11/SplashScreen.scale-200.png
deleted file mode 100644
index 1cc4213..0000000
Binary files a/windows11/SplashScreen.scale-200.png and /dev/null differ
diff --git a/windows11/SplashScreen.scale-400.png b/windows11/SplashScreen.scale-400.png
deleted file mode 100644
index 1624848..0000000
Binary files a/windows11/SplashScreen.scale-400.png and /dev/null differ
diff --git a/windows11/Square150x150Logo.scale-100.png b/windows11/Square150x150Logo.scale-100.png
deleted file mode 100644
index 66b2b73..0000000
Binary files a/windows11/Square150x150Logo.scale-100.png and /dev/null differ
diff --git a/windows11/Square150x150Logo.scale-125.png b/windows11/Square150x150Logo.scale-125.png
deleted file mode 100644
index 122efd7..0000000
Binary files a/windows11/Square150x150Logo.scale-125.png and /dev/null differ
diff --git a/windows11/Square150x150Logo.scale-150.png b/windows11/Square150x150Logo.scale-150.png
deleted file mode 100644
index 138d049..0000000
Binary files a/windows11/Square150x150Logo.scale-150.png and /dev/null differ
diff --git a/windows11/Square150x150Logo.scale-200.png b/windows11/Square150x150Logo.scale-200.png
deleted file mode 100644
index 3df2142..0000000
Binary files a/windows11/Square150x150Logo.scale-200.png and /dev/null differ
diff --git a/windows11/Square150x150Logo.scale-400.png b/windows11/Square150x150Logo.scale-400.png
deleted file mode 100644
index 8ad2366..0000000
Binary files a/windows11/Square150x150Logo.scale-400.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-16.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-16.png
deleted file mode 100644
index a7a43be..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-16.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-20.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-20.png
deleted file mode 100644
index 04e46ed..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-20.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-24.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-24.png
deleted file mode 100644
index 425081b..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-24.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-256.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-256.png
deleted file mode 100644
index e010e77..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-256.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-30.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-30.png
deleted file mode 100644
index 71e414a..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-30.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-32.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-32.png
deleted file mode 100644
index fcc4dfd..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-32.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-36.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-36.png
deleted file mode 100644
index 6c445e0..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-36.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-40.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-40.png
deleted file mode 100644
index 8ace4df..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-40.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-44.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-44.png
deleted file mode 100644
index e8c36d9..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-44.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-48.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-48.png
deleted file mode 100644
index f80d8db..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-48.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-60.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-60.png
deleted file mode 100644
index 17aa83d..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-60.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-64.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-64.png
deleted file mode 100644
index 2b57531..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-64.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-72.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-72.png
deleted file mode 100644
index 05c3427..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-72.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-80.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-80.png
deleted file mode 100644
index 0c218e0..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-80.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-lightunplated_targetsize-96.png b/windows11/Square44x44Logo.altform-lightunplated_targetsize-96.png
deleted file mode 100644
index 95edbe0..0000000
Binary files a/windows11/Square44x44Logo.altform-lightunplated_targetsize-96.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-16.png b/windows11/Square44x44Logo.altform-unplated_targetsize-16.png
deleted file mode 100644
index a7a43be..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-16.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-20.png b/windows11/Square44x44Logo.altform-unplated_targetsize-20.png
deleted file mode 100644
index 04e46ed..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-20.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-24.png b/windows11/Square44x44Logo.altform-unplated_targetsize-24.png
deleted file mode 100644
index 425081b..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-24.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-256.png b/windows11/Square44x44Logo.altform-unplated_targetsize-256.png
deleted file mode 100644
index e010e77..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-256.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-30.png b/windows11/Square44x44Logo.altform-unplated_targetsize-30.png
deleted file mode 100644
index 71e414a..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-30.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-32.png b/windows11/Square44x44Logo.altform-unplated_targetsize-32.png
deleted file mode 100644
index fcc4dfd..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-32.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-36.png b/windows11/Square44x44Logo.altform-unplated_targetsize-36.png
deleted file mode 100644
index 6c445e0..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-36.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-40.png b/windows11/Square44x44Logo.altform-unplated_targetsize-40.png
deleted file mode 100644
index 8ace4df..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-40.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-44.png b/windows11/Square44x44Logo.altform-unplated_targetsize-44.png
deleted file mode 100644
index e8c36d9..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-44.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-48.png b/windows11/Square44x44Logo.altform-unplated_targetsize-48.png
deleted file mode 100644
index f80d8db..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-48.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-60.png b/windows11/Square44x44Logo.altform-unplated_targetsize-60.png
deleted file mode 100644
index 17aa83d..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-60.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-64.png b/windows11/Square44x44Logo.altform-unplated_targetsize-64.png
deleted file mode 100644
index 2b57531..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-64.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-72.png b/windows11/Square44x44Logo.altform-unplated_targetsize-72.png
deleted file mode 100644
index 05c3427..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-72.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-80.png b/windows11/Square44x44Logo.altform-unplated_targetsize-80.png
deleted file mode 100644
index 0c218e0..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-80.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.altform-unplated_targetsize-96.png b/windows11/Square44x44Logo.altform-unplated_targetsize-96.png
deleted file mode 100644
index 95edbe0..0000000
Binary files a/windows11/Square44x44Logo.altform-unplated_targetsize-96.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.scale-100.png b/windows11/Square44x44Logo.scale-100.png
deleted file mode 100644
index e8c36d9..0000000
Binary files a/windows11/Square44x44Logo.scale-100.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.scale-125.png b/windows11/Square44x44Logo.scale-125.png
deleted file mode 100644
index c9f66b8..0000000
Binary files a/windows11/Square44x44Logo.scale-125.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.scale-150.png b/windows11/Square44x44Logo.scale-150.png
deleted file mode 100644
index f57e5a7..0000000
Binary files a/windows11/Square44x44Logo.scale-150.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.scale-200.png b/windows11/Square44x44Logo.scale-200.png
deleted file mode 100644
index 8ca69c9..0000000
Binary files a/windows11/Square44x44Logo.scale-200.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.scale-400.png b/windows11/Square44x44Logo.scale-400.png
deleted file mode 100644
index 03dbb57..0000000
Binary files a/windows11/Square44x44Logo.scale-400.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-16.png b/windows11/Square44x44Logo.targetsize-16.png
deleted file mode 100644
index a7a43be..0000000
Binary files a/windows11/Square44x44Logo.targetsize-16.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-20.png b/windows11/Square44x44Logo.targetsize-20.png
deleted file mode 100644
index 04e46ed..0000000
Binary files a/windows11/Square44x44Logo.targetsize-20.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-24.png b/windows11/Square44x44Logo.targetsize-24.png
deleted file mode 100644
index 425081b..0000000
Binary files a/windows11/Square44x44Logo.targetsize-24.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-256.png b/windows11/Square44x44Logo.targetsize-256.png
deleted file mode 100644
index e010e77..0000000
Binary files a/windows11/Square44x44Logo.targetsize-256.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-30.png b/windows11/Square44x44Logo.targetsize-30.png
deleted file mode 100644
index 71e414a..0000000
Binary files a/windows11/Square44x44Logo.targetsize-30.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-32.png b/windows11/Square44x44Logo.targetsize-32.png
deleted file mode 100644
index fcc4dfd..0000000
Binary files a/windows11/Square44x44Logo.targetsize-32.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-36.png b/windows11/Square44x44Logo.targetsize-36.png
deleted file mode 100644
index 6c445e0..0000000
Binary files a/windows11/Square44x44Logo.targetsize-36.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-40.png b/windows11/Square44x44Logo.targetsize-40.png
deleted file mode 100644
index 8ace4df..0000000
Binary files a/windows11/Square44x44Logo.targetsize-40.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-44.png b/windows11/Square44x44Logo.targetsize-44.png
deleted file mode 100644
index e8c36d9..0000000
Binary files a/windows11/Square44x44Logo.targetsize-44.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-48.png b/windows11/Square44x44Logo.targetsize-48.png
deleted file mode 100644
index f80d8db..0000000
Binary files a/windows11/Square44x44Logo.targetsize-48.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-60.png b/windows11/Square44x44Logo.targetsize-60.png
deleted file mode 100644
index 17aa83d..0000000
Binary files a/windows11/Square44x44Logo.targetsize-60.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-64.png b/windows11/Square44x44Logo.targetsize-64.png
deleted file mode 100644
index 2b57531..0000000
Binary files a/windows11/Square44x44Logo.targetsize-64.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-72.png b/windows11/Square44x44Logo.targetsize-72.png
deleted file mode 100644
index 05c3427..0000000
Binary files a/windows11/Square44x44Logo.targetsize-72.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-80.png b/windows11/Square44x44Logo.targetsize-80.png
deleted file mode 100644
index 0c218e0..0000000
Binary files a/windows11/Square44x44Logo.targetsize-80.png and /dev/null differ
diff --git a/windows11/Square44x44Logo.targetsize-96.png b/windows11/Square44x44Logo.targetsize-96.png
deleted file mode 100644
index 95edbe0..0000000
Binary files a/windows11/Square44x44Logo.targetsize-96.png and /dev/null differ
diff --git a/windows11/StoreLogo.scale-100.png b/windows11/StoreLogo.scale-100.png
deleted file mode 100644
index 123b4a5..0000000
Binary files a/windows11/StoreLogo.scale-100.png and /dev/null differ
diff --git a/windows11/StoreLogo.scale-125.png b/windows11/StoreLogo.scale-125.png
deleted file mode 100644
index df571fd..0000000
Binary files a/windows11/StoreLogo.scale-125.png and /dev/null differ
diff --git a/windows11/StoreLogo.scale-150.png b/windows11/StoreLogo.scale-150.png
deleted file mode 100644
index bed110c..0000000
Binary files a/windows11/StoreLogo.scale-150.png and /dev/null differ
diff --git a/windows11/StoreLogo.scale-200.png b/windows11/StoreLogo.scale-200.png
deleted file mode 100644
index 0e513d4..0000000
Binary files a/windows11/StoreLogo.scale-200.png and /dev/null differ
diff --git a/windows11/StoreLogo.scale-400.png b/windows11/StoreLogo.scale-400.png
deleted file mode 100644
index 076a0fd..0000000
Binary files a/windows11/StoreLogo.scale-400.png and /dev/null differ
diff --git a/windows11/Wide310x150Logo.scale-100.png b/windows11/Wide310x150Logo.scale-100.png
deleted file mode 100644
index 9f1520a..0000000
Binary files a/windows11/Wide310x150Logo.scale-100.png and /dev/null differ
diff --git a/windows11/Wide310x150Logo.scale-125.png b/windows11/Wide310x150Logo.scale-125.png
deleted file mode 100644
index dd2a98d..0000000
Binary files a/windows11/Wide310x150Logo.scale-125.png and /dev/null differ
diff --git a/windows11/Wide310x150Logo.scale-150.png b/windows11/Wide310x150Logo.scale-150.png
deleted file mode 100644
index cf7fed7..0000000
Binary files a/windows11/Wide310x150Logo.scale-150.png and /dev/null differ
diff --git a/windows11/Wide310x150Logo.scale-200.png b/windows11/Wide310x150Logo.scale-200.png
deleted file mode 100644
index bf453eb..0000000
Binary files a/windows11/Wide310x150Logo.scale-200.png and /dev/null differ
diff --git a/windows11/Wide310x150Logo.scale-400.png b/windows11/Wide310x150Logo.scale-400.png
deleted file mode 100644
index 1cc4213..0000000
Binary files a/windows11/Wide310x150Logo.scale-400.png and /dev/null differ
diff --git "a/\345\240\261\345\221\212\346\233\270.md" "b/\345\240\261\345\221\212\346\233\270.md"
index e6abacb..fd29d27 100644
--- "a/\345\240\261\345\221\212\346\233\270.md"
+++ "b/\345\240\261\345\221\212\346\233\270.md"
@@ -1,5 +1,8 @@
 # 多輸出布林函數最小化工具 - 專案報告書
 
+> [!NOTE]
+> 這是 v1 課程專題的歷史報告，保留原始推導脈絡與當時用語。標準術語是 **Petrick’s Method**；v2 的功能、成本保證與限制以 `README.md`、TypeScript 核心及自動測試為準。
+
 ## 摘要
 
 本專案旨在開發一個功能完整且實用的多輸出布林函數最小化工具。傳統邏輯設計課程中的作業需求，通常僅要求處理質蘊涵項 (Prime Implicants, PI)，但這忽略了在真實應用中極為重要的 ==Don't Care== 條件。為了建構一個更全面的工具，本專案不僅完整支援了 Don't Care 項的處理，更因此衍生出兩種核心輸入模式：==「PI 輸入模式」==與==「Minterms 輸入模式」==，以應對不同的使用情境。
@@ -283,4 +286,4 @@ F3 = x'z' + x'y + xy'
 
 最後第三階段
 再次計算刪除冗餘後的成本$16+(總term數量-PI數量)=16+((3+2+3)-6)=18$
-最後才是成本18
\ No newline at end of file
+最後才是成本18
diff --git "a/\346\270\254\350\263\207.md" "b/\346\270\254\350\263\207.md"
index e9633f5..77e5192 100644
--- "a/\346\270\254\350\263\207.md"
+++ "b/\346\270\254\350\263\207.md"
@@ -1,3 +1,6 @@
+> [!NOTE]
+> 這是 v1 專題測資的歷史文件。v2 已將代表案例轉成 `tests/regression`，實際行為以自動測試為準。
+
 EXAMPLE 4.7
 a,b,c,d
 F1 = Σm(0,1,3,4,6,7,8,9,11,12,13,14,15)